Assertion: floyd warshall algorithm | /r/HasProperty | the shortest path
Facets:
Source sentences:
text: For example, Floyd–Warshall algorithm, the shortest path to a goal from a vertex in a weighted graph can be found by using the shortest path to the goal from all adjacent vertices.