finding the total number of distinct shortest paths between 2 nodes in undirected weighted graph in linear time?

Posted by logan on Stack Overflow See other posts from Stack Overflow or by logan
Published on 2012-10-27T16:57:28Z Indexed on 2012/10/27 17:00 UTC
Read the original article Hit count: 166

Filed under:

graph

|

shortest-path

I was wondering, that if there is a weighted graph G(V,E), and I need to find a single shortest path between any two vertices S and T in it then I could have used the Dijkstras algorithm. but I am not sure how this can be done when we need to find all the distinct shortest paths from S to T. Is it solvable on O(n) time? I had one more question like if we assume that the weights of the edges in the graph can assume values only in certain range lets say 1 <=w(e)<=2 will this effect the time complexity?

© Stack Overflow or respective owner

Related posts about graph

C++: Error in Xcode; "Graph::Coordinate::Coordinate()", referenced from: ...

as seen on Stack Overflow - Search for 'Stack Overflow'
In a program I am writing, I wrote for two classes (Coordinate, and Graph), with one of them taking the other as constructor arguments. When I try to compile it I get the following error for Graph.cpp: Undefined symbols: "Graph::Coordinate::Coordinate(double)", referenced from: Graph::Graph()… >>> More
How to create Line Graph and Bar graph on same parameters in asp.net

as seen on C# Corner - Search for 'C# Corner'
We can use GDI+ to draw chart components in C# or VB.NET language in memory and once the components are drawn in memory, we can save the drawing in an image on the Web server. Once the image is saved, we can display this image in an ASP.NET page using any Image tag or image control. >>> More
Display Graph using Boost Graph Library

as seen on Stack Overflow - Search for 'Stack Overflow'
Can anyone please tell me that once I've created a graph using Boost Graph library, how can I display that graph? My biggest concern is that the edge weights are coming from an exernal data source over the network. And I need to be able to display the edgeweights live as they get updated. >>> More
Matlab multiple graph types inside one graph

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, I have a task to draw electrostatic field between two electrodes( at given sizes and shape ), what i have now is that i draw the electrodes with area plot (area(elect_x,elect_y)) the graph looks like this: ------------------.--- |.. .---. |.. |...| |… >>> More
[C++] Write connected components of a graph using Boost Graph

as seen on Stack Overflow - Search for 'Stack Overflow'
I have an file that is a long list of weighted edges, in the following form node1_id node2_id weight node1_id node3_id weight and so on. So one weighted edge per line. I want to load this file into boost graph and find the connected components in the graph. Each of these connected components… >>> More

Related posts about shortest-path

Algorithm shortest path between all points

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, suppose I have 10 points. I know the distance between each point. I need to find the shortest possible route passing trough all points. I have tried a couple of algorithms (Dijkstra, Floyd Warshall,...) and the all give me the shortest path between start and end, but they don't make a route… >>> More
Shortest-path algorithms which use a space-time tradeoff?

as seen on Stack Overflow - Search for 'Stack Overflow'
I need to find shortest paths in an unweighted, undirected graph. There are algorithms which can find a shortest path between two nodes, but this can take time. There are also algorithms for computing shortest paths for all pairs of nodes in the graph, but storing such a lookup table would take lots… >>> More
C# - Shortest path map finding

as seen on Stack Overflow - Search for 'Stack Overflow'
I try to write a simple program in C#, it's like map finding . I've a picture of city / or district ( it's const ) and I'll add a database to this program to store variables, points . I use floyd to find the shortest path and I'll draw the path in the image ( by coordinates I think ) . This is the… >>> More
search all paths and the shortest path for a graph - Prolog

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi , I have a problem in my code with turbo prolog wich search all paths and the shortest path for a graph between 2 nodes the problem that i have is to test if the node is on the list or not exactly in the clause of member and this is my code : /* 1 ---- b ---- 3 … >>> More
Dijstra shortest path algorithm with edge cost.

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello, I have a directed, positive weighted graph. Each edge have a cost of use. I have only A money, i want to calculate shortest paths with dijkstra algorithm, but sum of edges costs on route must be less or equal to A. I want to do this with most smallest Dijstra modification (if I can do it… >>> More