Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 724ef3c

Browse files
Modified Dijkstra test typo
1 parent 2adccbd commit 724ef3c

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

‎test/com/jwetherell/algorithms/graph/test/Graphs.java‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -372,13 +372,13 @@ public void testDijstraUndirected() {
372372
for (Graph.Vertex<Integer> v : map1.keySet()) {
373373
final Graph.CostPathPair<Integer> path1 = map1.get(v);
374374
final Graph.CostPathPair<Integer> path2 = getIdealUndirectedPath(undirected).get(v);
375-
assertTrue("Dijstra's shortest path error. path1="+path1+" path2="+path2, path1.equals(path2));
375+
assertTrue("Dijkstra's shortest path error. path1="+path1+" path2="+path2, path1.equals(path2));
376376
}
377377

378378
final Graph.CostPathPair<Integer> pair1 = Dijkstra.getShortestPath(undirected.graph, start, end);
379379
assertTrue("No path from " + start.getValue() + " to " + end.getValue(), (pair1 != null));
380380

381-
assertTrue("Dijstra's shortest path error. pair="+pair1+" pair="+getIdealUndirectedPathPair(undirected), pair1.equals(getIdealUndirectedPathPair(undirected)));
381+
assertTrue("Dijkstra's shortest path error. pair="+pair1+" pair="+getIdealUndirectedPathPair(undirected), pair1.equals(getIdealUndirectedPathPair(undirected)));
382382
}
383383
}
384384

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /