1 votes 1 votes When can we have single source shortest path algorihm runs in Big Oh of number of edges. Options are like weighted graph, undirected graph, undirected and weighted, not possilbe (i dont remember all the options) Algorithms graph-algorithms + – Sankaranarayanan P.N asked Jun 25, 2015 • recategorized Dec 10, 2015 by Akash Kanase Sankaranarayanan P.N 579 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes yes O(E) is possible . then the graph should be directed acyclic graph . Pranay Datta 1 answered Jun 26, 2015 Pranay Datta 1 comment Share Follow See 1 comment See all 1 1 comment reply admin commented Sep 18, 2015 reply Follow Share In case of Directed Acyclic Graph complexity is O(V+E). Are you referring to some special case? If you are, would you explain it please. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Ya it can be done when the graph is unweighted using BFS. http://cseweb.ucsd.edu/~kube/cls/100/Lectures/lec12/lec12-28.html sonu answered Sep 18, 2015 sonu comment Share Follow See all 0 reply Please log in or register to add a comment.
