techInterview Discussion

In a graph with positive and negetive edges ,how would you find the shortest path,the graph does not have any loop.O(V+E) expected.Hint: Try to modify the BFS

Summer algorithms class kicking your ass, eh?

The idea is to traverse BFS and check for each nodes whether all the edges coming to it are covered or not...this is called critital path method

Ford's algo -

That's merely O(|V| |E|). In general, when professors give hints, they mean it.

Bellman Ford