MCPcopy Create free account
hub / github.com/TheAlgorithms/C-Plus-Plus / Shortest_Path_Distance

Function Shortest_Path_Distance

graph/bidirectional_dijkstra.cpp:62–72  ·  view source on GitHub ↗

* @brief This function returns the shortest distance from the source * to the target if there is path between vertices 's' and 't'. * * @param workset_ vertices visited in the search * @param distance_ vector of distances from the source to the target and * from the target to the source * */

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

BidijkstraFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected