An app where there can be applied some of the most used graphs algorithms on a drawn graph.
This app has been made using Maven and Java Swing.
App features:
-> Draw an undirect/directed/undirect with weight/directed with weight graph.
-> Draw the map of the Luxembourg where there can be used, for finding the path from two selected nodes, Dijkstra's algorithm or Bellman–Ford algorithm.
-> DFS
-> Kosaraju's Algorithm
-> Topological Sort
-> Arborescence Check
-> Root Node Check
-> Prim's MST
-> Kruskal's MST
-> Boruvka's MST
-> Ford-Fulkerson