## 18 packages found

simple and reasonably fast implementation of directed acyclic graphs and sets with focus on finding the fastest execution order of interdependent tasks

Directed graphs analyzer for parallel traversals

Simple library for working with directed graphs

dag-builder-js is a simple-to-use Javascript DAG library with support to N:N vertices/edges. It supports validating that no cycle can be created in real-time, import/export states and it's built on SVG so you can render graphs pretty much anywhere.

This is a package that helps you convert an array of edges to a directed or undirected graph(adjacency list)

- edges to graph
- edges to directed graph
- edges to undirected graph
- directed graph
- undirected graph
- edges to directed adjacency list
- edges to undirected adjacency list
- directed adjacency list
- undirected adjacency list
- graph
- adjacency list
- directed
- graphs
- undirected
- View more

React component to create interactive D3 directed acyclic graphs (DAGs)

- react
- d3
- tree
- dag
- component
- directed-acyclic-graph
- directed
- acyclic
- graph
- svg
- hierarchical-data
- hierarchy
- d3-visualization
- chart

Index for fast distance and shortest path queries on weighted directed graphs

Simple library to search and traverse graphs using DFS, BFS algorithms, and also detect cycles in directed graph input

Sparse & bitwise adjacency matrices, lists and selected traversal algorithms for directed & undirected graphs

- adjacency
- binary
- bitwise
- datastructure
- degree
- directed
- disjointset
- graph
- laplacian
- list
- matrix
- neighbors
- path
- search
- View more

An action-driven traverser of directed graphs

find and identify a cycle in a directed graph

- cycle
- cycles
- cyclic
- graph
- graphs
- directed
- directed-graph
- directed-graphs
- find
- finder
- search
- detect
- detector
- detection

Some JavaScript and TypeScript implementation of a graph data structure. Features: - Insert and remove nodes. - Connect and disconnect nodes. - Algorithms for graph structures.

- nodes
- graph
- graphs
- vertex
- vertices
- edge
- edges
- algorithm
- data structure
- weights
- cycle
- path finding
- shortest path
- directed
- View more

Library for representing, validating, and navigating directed graphs

node package for weighted directed graphs

JavaScript library for modeling directed graphs

Dijkstra & Floyd Warshall implementation for weighted directed and undirected graphs with iteration logging.

- Dijkstra
- Floyd-Warshall
- Graphs
- Algorithm
- Weighted
- Undirected
- Directed
- Logs
- Logging
- Shortest
- Cheapest
- Path
- Route
- Explanation

Keeps a directed acyclic graph topologically sorted each time you add an edge or vertex to check for cycles.

Operations to add and remove nodes (and their links) from d3 force directed graphs