monmohan / mgraphlib Goto Github PK View Code? Open in Web Editor NEW 8.0 6.0 2.0 705 KB 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 98.91% Python 1.09% Introduction ยท People ยท Discuss
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
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
Vue.js ๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
javascript JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Machine learning Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Facebook We are working to build community through open source technology. NB: members must have two-factor auth.