MSGL - Graph Library (MMI 2019)

MSGL or Maximal spannende Graphen Library is a Java Library that implements different Graph Algorithms.

Supported Algorithms

We currently support these algorithms:

• Breadth first search
• Depth first search
• Connected Graph Finder
• Kruskal MST
• Prim MST
• BranchAndBound for finding Tours
• DoubleTrees for finding Tours
• Nearest NEighbor for finding Tours
• Dijkstra
• Moore-Bellman-Ford
• Edmonds Karp
• Cycle Cancelling
• Successive Shortest Path

Contributors

This project is made and maintained by Jefski14 and Kyurai

License

MIT