Implemented classes :
✔ Node
✔ LinkedList + Queue ( Unecessary to next classes )
✔ Edge + Vertex ( for Graph class )
✔ Graph ( with implemented algorithms like BFS, DFS, visualisation )
✔ GraphPath ( Dijkstra, BFS algorithms )
This project's final aim was to find ,,All shortest paths'' between specific node and the rest in weighted graph, as u can see below :
We got sample Graph :
We are trying to find all shortest paths between node "0" and the rest, so next steps are as follows :
1
2
3
4
5
6
Done - we found all shortest paths between node "0" and the rest using modified Dijkstra's Algorithm. 😄