You are given a function shortest_path(node *n1,node *n2,set<Edge> edges) which finds the second shortest path. We need to find a second shortest path in constant time.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
