SCORE: 00000000
A Fast Solution for Network Design
A linear programming algorithm in order to find a network design that has the minimal cost in a given network graph.
ACHIEVEMENTS
- Implemented Dijkstra's algorithm in Java to find shortest path between two nodes in a graph
- Generated graphs for project report by using a graph generating library python-igraph
SCREENSHOTS
capacity graph generated by python-igraph
capacity graph generated by python-igraph