Computing shortest path in a graph, Computer Networking

While calculating shortest path, first we assume graph presentation of network at every node then we use Djikstra's algorithm to calculate shortest path from every node to other one. Then extract next hop information from giving path information and add next hop information into routing tables.


Djikstra's algorithm will add weights on edges in graph. The shortest path is then the path with minimum total weight. It could be noticed that the shortest path is not necessarily with fewest edges. For example as given in the figure below:

2244_weighted graph.png

The minimum path in the diagram from node 2 to node 6 is 2 to 3 and 3 to 6 as this way has the minimum weight so it is the shortest path.


Weights on graph nodes denote cost of traversing edge. This cost can be in time, hop or dollars counting (weight == 1). The resulting shortest path can not have fewest hops.

Posted Date: 7/31/2012 7:00:00 AM | Location : United States

Related Discussions:- Computing shortest path in a graph, Assignment Help, Ask Question on Computing shortest path in a graph, Get Answer, Expert's Help, Computing shortest path in a graph Discussions

Write discussion on Computing shortest path in a graph
Your posts are moderated
Related Questions
Virtual channel is normally a link from one source to one destination, although multicast connections are also allowed. The other name for virtual channel is virtual circuit.

Half-Duplex - Capability for data transmission in only single direction at a time among sending station and a receiving station.

Recognize the mode reflected by the following prompt 'Router '? Ans) RXBoot

#clasification of inductor

What is the basic difference between latches and flip flops? Ans) flip flops have clock signal whereas latches dont require anyclock pulse..

Reverse Address Resolution Protocol - RARP is ARP's counterpart, but it resolves IP addresses to MAC addresses typically on diskless workstations.

Mention different categories of computer networks (on the basis of scale) and distinguish one from the other. Local Area Network (LAN): Metropolitan Area Network (MAN): W

Q. Show the Class A Addresses? Class A Addresses Numerically the lowest Use merely one byte to identify the class type and netid Three bytes are obtainable

NETWORK ANALYZERS: A network analyzer also known network monitor or a network sniffer is used to calculate the performance of or debug a network. It may report statistics s

Determine about the Complete and proper security Complete and proper security configuration and administration is indeed a complex issue. One should think carefully about the