Assertion: algorithm | /r/HasProperty | run with starting node
Facets:
Source sentences:
text: Its key property will be that if the algorithm was run with some starting node, then every path from that node to any other node in the new graph will be the shortest path between those nodes in the original graph, and all paths of that length from the original graph will be present in the new graph.