Graph Operations
Graph layout, DAG topological sort, topology analysis, aggregate computation, and network structure analysis
17 toolsgraph-ops
Aggregate Fold
Run all standard folds (sum, count, min, max, mean, variance) in one pass.
no params
Aggregate Outliers
Detect outliers using the IQR method.
no params
Aggregate Percentile
Compute a specific percentile from values.
no params
Aggregate Rank
Rank items by value, optionally returning only top N.
no params
Aggregate Tree Fold
Parse a JSON tree and perform recursive fold.
no params
Dag Publish Dry Run
No cargo invocations — purely a DAG computation.
no params
Dag Publish Plan
once all prior phases are complete.
no params
Dag Publish Status
referenced against the checkpoint file to produce a pending list.
no params
Graph Analyze
Analyze a graph structure.
no params
Graph Centrality
Compute betweenness centrality for all nodes
no params
Graph Components
Find connected components (treating edges as undirected)
no params
Graph Construct
Construct a graph from various data sources.
no params
Graph Layout Converge
Supports 2D and 3D layout, normalizes positions to [-1, 1].
no params
Graph Shortest Path
Find shortest path between two nodes (BFS, unweighted)
no params
Topo Betti
Compute Betti numbers at a specific filtration value
no params
Topo Persistence
Compute persistent homology from a distance matrix
no params
Topo Vietoris Rips
Build a Vietoris-Rips complex and return its structure
no params