monmohan / mgraphlib Public

Notifications You must be signed in to change notification settings
Fork 2
Star 8

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.

8 stars 2 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 48 Commits
.idea/libraries		.idea/libraries
docs		docs
lib		lib
src		src
README.md		README.md

Repository files navigation

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

About

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.

Report repository

Releases

No releases published

Packages

No packages published

Languages