- A simple graph visualizer written with Qt. Based on this example.
- Dijkstra algorithm to find the shortest path between 2 nodes.
- A modified Hungarian algorithm to find the minimum cost maxmium matching.
- (Probably) A* algorithm.
To be updated ...
To be updated ...