Directed and Undirected graph implementation based on the following node structure
A simple undirected graph that allows for finding the shortest path between nodes via Dijkstra's algorithm
Implementation of the Bron-Kerbosch algorithm to find the maximal cliques in an undirected graph.
Sparse & bitwise adjacency matrices and related functions for directed & undirected graphs
Finds connected components of an undirected graph
The default blueprint for ember-cli addons.
A graph theory library