This is going to be a library for various graph-related algorithms. For now it can only be used as a simple implementation of graph, but if I have enough time the library is going to grow. Check out the roadmap and feel free to contribute — there is no good enough graph-related javascript library yet.
-
Implement simple Graph entity using different containers (Set, custom HashTable-ish ES5 implementation) The problem is that simple array-based implementation lacks performance for obvious reasons, that is why we either have to use new ES6 containers such as Map and Set (which is working only in Firefox) or implement custom hash table container that accept Objects as keys. Interesting to see how efficient different implementations are.
-
Make efficient implementations for different types of special graphs including trees and allow tree->graph and graph->tree conversion as soon as Graph is acyclic, make efficient representations for various graph-related tasks.
-
Implement basic algorithms: Dijkstra’s algorithm, Ford–Fulkerson for flow networks etc. If you never implemented those algorithms — this is your chance to try one. Feel free to grab wikipedia, implement, write tests and commit.
Just run this when you check out repository:
npm run build
There is no actual npm package yet, because nothing is done that worth releasing. The API will certainly change, so it isn't gonna be useful as a package.