strongly-connected-components
Computes strongly connected components of a directed graph
Computes strongly connected components of a directed graph
Various dominator tree generators.
Tarjan-Lengauer dominator search algorithm
Check for dependency cycles using Tarjan's strongly connected components algorithm
Find the entry points in a set of JavaScript files.
tarjan's algoirthm for finding strongly connected components
A Typescript port of the Ruby TSort module
nv-dag-adjmat is a simple util for adjacency-table for graph
Data Structures of Javascript & TypeScript. Binary Tree, BST, Graph, Heap, Priority Queue, Linked List, Queue, Deque, Stack, AVL Tree, Tree Multiset, Trie, Directed Graph, Undirected Graph, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Qu
Standard data structure