The algorithm you have suggested will indeed find the shortest path in this graph, but not all graphs in general. For example, consider this graph: Let’s trace through the execution of your algorithm. First, you set d(A) to 0 and the other distances to ∞. You then expand out node A, setting d(B) to 1, … Read more
I found this page in my search and since cycles are not same as strongly connected components, I kept on searching and finally, I found an efficient algorithm which lists all (elementary) cycles of a directed graph. It is from Donald B. Johnson and the paper can be found in the following link: http://www.cs.tufts.edu/comp/150GA/homeworks/hw1/Johnson%2075.PDF A … Read more
All these data structures are used for solving different problems: Segment tree stores intervals, and optimized for “which of these intervals contains a given point” queries. Interval tree stores intervals as well, but optimized for “which of these intervals overlap with a given interval” queries. It can also be used for point queries – similar … Read more