Implement Dijkstra Algorithm in Java - Part 1 / 5

Learn to implement Dijkstra Algorithm in Java. Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph.

This is the Part 1 / 5 where you're going to create the Node and Edge for the Graph.

[leej]

5:55 I am having hard time understanding getNeighbourIndex() method. How's that let you know the neighbor nodes of supplied node. Let's say current node is "4" and neighbor nodes are "3" and "5". graph.getNeighbourIndex(5) should you give you "3" and "5"?

[aliazouali]

do you knowing somethings about Chen's algorithm please??

[LinhHoang-rsku]

I copy exactly you code, but it not run in Eclipse by me. Please give me a revised. Thanks


Exception in thread "main"
at
at

Graph.java:25 :

Main.java:23 :
Graph g = new Graph(edges);

[Luklyn]

What about if an edge has more than two nodes attached to it? Then the function getNeighbourIndex() will not work 😅 how would you change it?