top button
Flag Notify
    Connect to us
      Facebook Login
      Site Registration Why to Join

Facebook Login
Site Registration

Given a graph, find the number of shortest paths present between source and destination?

0 votes
78 views

Given a graph and a source node and destination node, find the number of shortest paths present between source and destination?

posted Jun 2, 2016 by anonymous

Looking for an answer?  Promote on:
Facebook Share Button Twitter Share Button LinkedIn Share Button
There is an algorithm called as Dijkstra algorithm for finding shortest path from one node to another for a weighted graph (the weight of the graph must be positive), and there is no such things as "number of shortest path", there is only one shortest path from source to destination node.

Contact Us
+91 9880187415
sales@queryhome.net
support@queryhome.net
#280, 3rd floor, 5th Main
6th Sector, HSR Layout
Bangalore-560102
Karnataka INDIA.
QUERY HOME
...