[](https://travis-ci.org/tmont/tarjan-graph) [](https://www.npmjs.com/package/tarjan-graph)
Tarjan-Lengauer dominator search algorithm
Find strongly connected components of a directed graph using [Tarjan's algorithm](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm).
Forked from tmont/tarjan-graph
tarjan's algoirthm for finding strongly connected components
Find biconnected component in a graph using algorithm by John Hopcroft and Robert Tarjan
Find strongly connected components of a directed graph using [Tarjan's algorithm](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm).
Detect circular dependencies in Rollup projects
No description provided.
Various dominator tree generators.
Static code analysis platform — builds a Knowledge Graph from source code with Web UI, HTTP API, CLI, and MCP server
Visualise the dependency graph of a JavaScript / TypeScript project from your terminal.
Deterministic Datalog interpreter for codegraph invariants — pure TS, zero binary
A set of functions for working with trees
JSON pipeline for abstract compiler
No description provided.
Standard Datalog invariants for TypeScript + Postgres projects — drop-in for codegraph-toolkit
Check for dependency cycles using Tarjan's strongly connected components algorithm
No description provided.
Computes strongly connected components of a directed graph
Repository scanner that builds a structural map of a codebase (functions, imports, exports, dependencies) and adds file descriptions of what the file does,, so anagentic AI can just read the map and know the project context
Local-first interactive 3D codebase knowledge globe (AST-based, no embeddings).
A NodeJs implementation of Splay Tree binary search algorithm
No description provided.
Tarjan's SCC algorithm implemented non-recursively and optimized
Gabow-Tarjan linear-time algorithm for incremental tree set union (JCSS 1985)
Three union-find implementations
Work with directed graphs.
Trait-based Strongly Connected Components Calculation
Fast, AST-based code-navigation: shape, public API, deps & call graphs, hybrid semantic search, structural rewrite, and log squeezing. MCP server included.
A graph-based LLM white-box optimization toolbox: topology validation, Lie group orthogonalization, tensor ring compression
Find the strongly-connected components of a graph with nodes labeled by integer ids
A Rust library implementing the ASPIC+ framework for structured argumentation
🎡 Detect workspace dependency cycles in Rust monorepos
A graph-based LLM white-box optimization toolbox: topology validation, Lie group orthogonalization, tensor ring compression
A type-safe, scope-aware graph library that leverages Rust's type system to prevent common graph-related bugs at compile time
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.