MHB Counting shortest paths in a non-directed graph using BFS

  • Thread starter Thread starter evinda
  • Start date Start date
AI Thread Summary
The discussion focuses on finding an algorithm to calculate the number of shortest paths between two nodes, v and u, in a non-directed graph G. The proposed solution involves using Breadth-First Search (BFS) to traverse the graph. During the BFS process, as nodes are added to the queue, the algorithm also counts the number of shortest paths leading to each node. This approach is suggested to operate within the desired time complexity of O(n + m), where n is the number of vertices and m is the number of edges. Participants are encouraged to implement the algorithm and evaluate its effectiveness and performance.
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! (Wave)

A non-directed graph $G=(V,E)$ and two nodes $v$ and $u$ of $G$ are given. Give an algorithm that calculates the number of shortest paths $v-u$ in $G$. (The algorithm doesn't have to print all the paths, just how many exist.) The algorithm should run in time $O(n+m)$ for a graph with $n$ vertices and $m$ edges. Is it like that?

We apply BFS. At the point where we add the nodes in the queue, we calculate also the number of nodes.
 
Technology news on Phys.org
What do you think? Have you tried implementing it to see if it sort of works, try and measure the complexity, ...?
 
Thread 'Is this public key encryption?'

Thread 'Is this public key encryption?'

I've tried to intuit public key encryption but never quite managed. But this seems to wrap it up in a bow. This seems to be a very elegant way of transmitting a message publicly that only the sender and receiver can decipher. Is this how PKE works? No, it cant be. In the above case, the requester knows the target's "secret" key - because they have his ID, and therefore knows his birthdate.
View full post »

Thread 'Who is responsible for the software when AI takes over programming?'

I tried a web search "the loss of programming ", and found an article saying that all aspects of writing, developing, and testing software programs will one day all be handled through artificial intelligence. One must wonder then, who is responsible. WHO is responsible for any problems, bugs, deficiencies, or whatever malfunctions which the programs make their users endure? Things may work wrong however the "wrong" happens. AI needs to fix the problems for the users. Any way to...
View full post »

Similar threads

MHB Find path to minimum cost from start to finish
Replies
19
Views
2K
Python BFS Shortest Distance of Graph Calculation in Python
Replies
1
Views
5K
Comp Sci Using Single Source Shortest Path Algorithm to find the longest path
Replies
4
Views
2K
I Traffic simulation : directed graph including specific rules
Replies
5
Views
2K
MHB Find the greatest of the shortest paths
Replies
7
Views
2K
MHB Find Algorithm for O(V*E) Transitive Closure of a Graph
Replies
11
Views
3K
Comp Sci Shortest path problem in bipartite graph
Replies
1
Views
2K
MHB Proving Longest Path Belongs to NP & Reducing Hamiltonian Path
Replies
19
Views
4K
MHB What is the Time Complexity of this Vertex Cover Algorithm?
Replies
1
Views
1K
MHB Dynamic programming: which recurrence relation do we use?
Replies
2
Views
2K

Hot Threads

Recent Insights

Back
Top