bellman-ford's algo works on graph having -ve edge cycle, but dijkstra algo would not work on that type of graph, it is implemented on the graph of +ve edges.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
