Assertion: algorithm's implementation | /r/CapableOf | fill two arrays
Facets:
Source sentences:
text: This implementation takes in a graph, represented as // lists of vertices and edges, and fills two arrays // (distance and predecessor) about the shortest path // from the source to each vertex // Step 1: initialize graph for each vertex v in vertices do distance[v] := inf