strongly-connected-components
Computes strongly connected components of a directed graph
Computes strongly connected components of a directed graph
Remove self intersections, t-junctions and duplicate edges/vertices from a planar straight line graph
Convert a list of edges to an adjacency list
Convert a planar graph to a collection of nest polylines
Find the faces of a planar graph
Simplifies a planar graph
Test if two sets of integers are equal up to an even permutation
An ordering for sets of integers
D3-based reusable chart library
A directed and undirected multi-graph library
DataStax Node.js Driver for Apache Cassandra
Graph theory (a.k.a. network) library for analysis and visualisation
walk the dependency graph to generate json output that can be fed into browser-pack
Apache Echarts components for React.
CLI bar charts
A reusable charting library written in d3.js
It iterates through a graph or a tree recursively
A dynamic, browser-based visualization library.
React wrapper for highcharts
Topological sort