Given a directed weighted graph, we need to mark all edges (represented by an ordered triple of (source,destination,weight) ) which lie on some shortest path from source to destination (there could be more than one shortest path);
I know that it can be done by running Dijkstra two times, first from source and another from destination with edges inverted. But i am not very clear about this algo so that i could implemment it,all i need a little description or explanation.... Thank You