Graph algorithm implementations based on lectures from Steven S. Skiena (http://www.cs.sunysb.edu/~skiena/). Implemented with callback and hooks to allow usage of library in applications.
Java Python
Switch branches/tags
Nothing to show
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
.idea/libraries
docs
lib
src
README.md

README.md

What is available

  • Basic Graph structure uses Adjacency List
  • Directed/Undirected, Weighted/UnWeighted
  • Breadth first search traversal with callbacks
  • Shortest Path on unweighted graphs
  • Depth first search traversal with callbacks
  • Topological sort
  • Cycle Detection
  • Bipartite Test (Two Coloring Traversal)
  • Minimum Spanning Tree Prim
  • Binary Heap
  • Binomial Heap
  • Minimum Spanning Tree Kruskal
  • Union-Find
  • Shortest Path on weighted Graphs (Dijkstra)

Coming Soon

  • Fibonacci Heap
  • GXL integration
  • DB connectors