Week2 assignment is about undirected graph

[oren0e]

The assignment for Dijkstra's algorithm is given on an undirected graph, but here all the test cases are for directed graphs. Is this on purpose? Can anyone explain why?

[styrmis]

Given the adjacency list format, to write out an undirected graph you write out edges in both directions.

So for example in this test case node 1 is connected to node 20 with weight 460, so if we look at the entry for node 20 we can see a reciprocal connection back to node 1 with the same weight (460).

[oren0e]

Thanks, I figured it out later. Closing the issue.