Tarjan Packages

Computes strongly connected components of a directed graph

Various dominator tree generators.

Find the entry points in a set of JavaScript files.

Tarjan-Lengauer dominator search algorithm

Check for dependency cycles using Tarjan's strongly connected components algorithm

nv-dag-adjmat is a simple util for adjacency-table for graph

Javascript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree(BST), AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max

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

tarjan's algoirthm for finding strongly connected components

Javascript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree(BST), AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max

A Typescript port of the Ruby TSort module