Answer:
D)
Explanation:
A web community, also known as an online community, is a community made up of members who comment, post, advice and collaborate on discussions of common interest, by communicating through the internet. It is a virtual community.
Examples of online communities include social networking sites, forums, email, discussion boards etc.
The web community can become a global community in the sense that, members can come from any geographical region with access to the internet, around the world. A web community may have members from New Zealand, Switzerland, United States, United Kingdom, Nigeria, China etc.
An internet connection is required to join a web community. You can join an online community after registering by filling out forms and accepting to abide by the rules and regulations guiding members. Non-members are allowed to contribute to discussions in some web communities but might not benefit from several privileges accorded members.
Answer:
Following are the step by step algorithms is explain below.
Explanation:
Following are the algorithm for searching shortest distances.
- Firstly, Initialize the array variable distance[] = {INF, INF, ….} as well as distance[s] = 0 in which the variable 's' is the beginning vertex
- Then, you have to develop a topological order of the following vertices.
- So, Do in the following for mostly vertex that is the variable 'u' in the topological order.
Do on the following for mostly contiguous vertex that is 'v' of 'u'
if (dist[v] > dist[u] + weight(u, v))
dist[v] = dist[u] + weight(u, v)