Graph Tools
Browse all available graph tools.
Available tools
- Adjacency Entry Absent Zero Crosswalk Represent an explicit adjacency entry with a zero absence sentinel and flag a present zero-weight collision.
- Adjacency Zero Vs Absent Policy Tool Resolve one adjacency entry using explicit presence and zero-weight conventions. A zero-weight edge is retained unless the caller explicitly treats zero as absent.
- Bfs Layer Edge Level Gap Tool Check the necessary BFS level constraint for a directed edge from first to second or an undirected edge.
- Bipartite Graph Checker Two-color an undirected graph and detect odd cycles or self-loops. Vertices are zero-based indices, and disconnected components are handled.
- Bipartite Projection Shared Neighbor Pair Tool Calculate bipartite projection shared neighbor pair from explicit caller-supplied inputs.
- Connected Components Finder Label the weakly connected components of a graph over an adjacency map.
- Digraph In Out Degree Imbalance Subtract explicit in-degree from out-degree and report local balance without asserting Eulerian connectivity.
- Dijkstra Shortest Path Calculator Find shortest paths from a start node over non-negative weighted directed edges given as [from, to, weight] rows.
- Directed Complement One Node Degree Tool Calculate directed complement one node degree from explicit caller-supplied inputs.
- Directed Edge Incidence Column Sum Tool Use oriented incidence -1 at the source and +1 at the target, including cancellation for a loop.
- Directed Edge Reversal Record Tool Reverse one directed edge while preserving its explicit edge identifier.
- Directed Edge Source Target Incidence Sign Tool Compute directed edge source target incidence sign from explicit bounded inputs.
- Directed Graph Density Loop Policy Tool Compute directed graph density loop policy from explicit bounded inputs.
- Directed Loop In Out Degree Pair Tool Calculate directed loop in out degree pair from explicit caller-supplied inputs.
- Disconnected Distance Infinity Token Tool Calculate disconnected distance infinity token from explicit caller-supplied inputs.
- Edge Betweenness Normalization Denominator Tool Compute edge betweenness normalization denominator from explicit bounded inputs.
- Edge Biconnected Component Count Tool Count undirected vertex components after removing bridges, including isolated vertices; parallel edges and self-loops are preserved.
- Edge Contraction Selfloop Count Delta Tool Count local loops after merging endpoints; explicitly select whether contracted inter-endpoint edges survive as loops.
- Edge Endpoint Degree Product Tool Calculate edge endpoint degree product from explicit caller-supplied inputs.
- Edge ID Trail Validity Check Verify an edge-ID trail with no repeated edge occurrences from an explicit start; directed or undirected traversal, with failure indexes retained.
- Edge List Boundary Cut Selector Select edges crossing an explicit vertex-set boundary using endpoint exclusive membership; direction and occurrence IDs remain intact.
- Edge List Degree Sum Audit Audit degree-sum identities on occurrence-preserving directed edges; loops contribute twice to undirected degree and parallel occurrences count.
- Edge List Direction Reverser Reverse every directed edge observation without normalization, retaining edge IDs, weights and parallel edges.
- Edge List Endpoint Membership Audit Audit edge endpoints against an explicit declared vertex set; missing vertices remain violations instead of being auto-added.
- Edge List Incident Selector Select edge observations incident to an explicit vertex in either endpoint without discarding IDs, multiplicity or weights.
- Edge List Induced Subgraph Selector Select the vertex-induced edge observations for an explicit vertex set, preserving isolated declared vertices and occurrence identities.
- Edge List Parallel Edge Buckets Inventory parallel edge occurrences with exact directed or undirected endpoint equivalence; retain multiplicities rather than normalize away duplicates.
- Edge List Reciprocal Pair Table Return reciprocal directed nonloop edge occurrence pairs, retaining parallel occurrences and excluding self-loop self-reciprocity.
- Edge List Self Loop Partitioner Partition edge observations into self-loops and nonloops while preserving edge IDs, weights and caller order.
- Edge List Single Edge Canonical Order Tool Calculate edge list single edge canonical order from explicit caller-supplied inputs.
- Edge List Undirected Orientation Tool Orient each undirected edge occurrence lexicographically while preserving weights, IDs and multiplicity; does not deduplicate adjacency.
- Edge List Vertex Renaming Tool Rename all observed edge endpoints with an explicit injective complete mapping; no vertex merging or inferred aliases.
- Edge List Walk Validity Check Verify consecutive vertex transitions against explicit directed or undirected edge observations; repeated vertices and edges are allowed in a walk.
- Edge List Weight Threshold Partition Partition weighted edge observations at an explicit inclusive threshold, preserving signed weights and all occurrence identities.
- Edge Loop Endpoint Check Tool Check whether one graph edge is a self-loop by exact, case-sensitive endpoint identity.
- Edge Reciprocity Indicator Tool Inspect one directed pair; a self-loop has identical forward/reverse flags and counts once.
- Edge Role DAG Back Edge Witness Tool Compose a proposed edge with a caller-asserted directed reverse path; this does not verify path edges against a graph.
- Edge Subdivision Vertex Edge Delta Tool Calculate edge subdivision vertex edge delta from explicit caller-supplied inputs.
- Edge Weight Unit Reference Label Qualify an explicit graph edge-weight meaning by unit wording without assigning weights.
- Eulerian Path Finder Find an undirected multigraph trail that traverses every edge exactly once, or report that none exists. Parallel edges and self-loops are retained.
- Graph Adjacency List to Matrix Converter Convert an adjacency map into a square 0/1 matrix with sorted node order.
- Graph Adjacency Matrix to List Converter Convert a square 0/1 adjacency matrix into an adjacency map of sorted neighbor lists.
- Graph Breadth-First Traversal Visit every node reachable from a start node in breadth-first order over directed edges, visiting neighbors in ascending order and reporting each node's depth.
- Graph Bridge Single Cut Edge Budget Tool Compute graph bridge single cut edge budget from explicit bounded inputs.
- Graph Cartesian Product Degree Term Tool Calculate graph cartesian product degree term from explicit caller-supplied inputs.
- Graph Color Single Edge Conflict Tool Calculate graph color single edge conflict from explicit caller-supplied inputs.
- Graph Complement Edge List Build the loop-free complement on an explicit bounded vertex set; parallel edges count as one adjacency and directed complements use ordered pairs.
- Graph Component Merge Count Step Tool Calculate graph component merge count step from explicit caller-supplied inputs.
- Graph Cycle Checker Detect whether a directed graph contains a cycle using Kahn's algorithm and report which nodes could not be resolved.
- Graph Declared Bipartition Edge Audit Verify a supplied disjoint bipartition against each edge occurrence, reporting unknown endpoints and within-side edges rather than finding a new coloring.
- Graph Degree Calculator Count each node's degree, in-degree, and out-degree over an adjacency map.
- Graph Degree Sequence Single Node Budget Tool Calculate graph degree sequence single node budget from explicit caller-supplied inputs.
- Graph Density Calculator Compute how many of the possible node pairs are connected, ignoring self-loops.
- Graph Depth-First Traversal Visit every node reachable from a start node in iterative depth-first preorder over directed edges, descending into the smallest-numbered neighbor first and reporting each node's depth.
- Graph Distance Parity Edge Flip Tool Compute graph distance parity edge flip from explicit bounded inputs.
- Graph Edge List Normalizer Canonicalize an adjacency map into sorted unique nodes and a deterministic deduplicated edge list.
- Graph Join Isolated Node Degree Shift Tool Degree shift when joining a supplied simple graph to an independent group of isolated vertices.
- Graph Join One Node Degree Increment Tool Calculate graph join one node degree increment from explicit caller-supplied inputs.
- Graph Label Canonical Number String Guard Tool Check canonical safe-integer decimal spelling for a graph label; labels are never coerced in graph operations.
- Graph Line Adjacency Builder Build undirected line-graph adjacency between distinct edge occurrences sharing endpoints; original edge IDs become vertices and loops do not create line self-loops.
- Graph Loop Parallel Simplicity Check Audit explicit edge occurrences for self-loops and parallel endpoint pairs under directed or undirected graph simplicity.
- Graph Node ID Type Collision Flag Tool Compute graph node id type collision flag from explicit bounded inputs.
- Graph Path Reversal Oriented Edge Sign Tool Calculate graph path reversal oriented edge sign from explicit caller-supplied inputs.
- Graph Self Loop Incidence Convention Tool Report the loop entry under signed directed or unsigned degree-incidence convention.
- Graph Topological Order Verifier Verify an explicit proposed topological order against every directed edge occurrence; unlike topological sorting it does not produce a replacement order.
- Graph Topological Sort Order the nodes of a directed acyclic graph with Kahn's algorithm, always emitting the lexicographically smallest available node first.
- Graph Vertex Split Degree Balance Tool Compute graph vertex split degree balance from explicit bounded inputs.
- Graph Walk Edge Continuity Check exact consecutive endpoint continuity of an explicitly ordered directed edge list, accepting an empty walk.
- Graph Walk Vertex Occurrence Position Tool Calculate graph walk vertex occurrence position from explicit caller-supplied inputs.
- Graph: Bipartite Edge Partition Pair Check Tool Check one undirected edge against explicit disjoint bipartition vertex labels, retaining unknown endpoints without claiming the whole graph is bipartite.
- Graph: Complement Graph Single Pair Membership Tool Evaluate complement membership of one nonloop pair in an explicit simple undirected vertex universe; original membership is caller established.
- Line Graph One Edge Degree Tool Return an edge vertex degree in the line graph of a simple loopless graph.
- Minimum Spanning Tree Finder Find a minimum spanning tree of an edge-weighted graph using Kruskal's algorithm; disconnected graphs get a minimum spanning forest.
- Multigraph Edge Key Occurrence Suffix Build an explicit multigraph edge occurrence key, canonicalizing undirected endpoints by UTF-16 lexical order.
- Multigraph Loop Adjacency Diagonal Weight Tool Compute multigraph loop adjacency diagonal weight from explicit bounded inputs.
- Multigraph Parallel Edge Identity Token Tool Distinguish explicit edge identity from endpoint coincidence in a directed or undirected multigraph.
- Multigraph Parallel Edge Multiplicity Update Tool Calculate multigraph parallel edge multiplicity update from explicit caller-supplied inputs.
- Node Classification Demonstrator Combine a node’s class scores with weighted neighbor scores and predict a class.
- Node2vec Transition Demonstrator Calculate second-order node2vec transition probabilities from return, in-neighborhood, and outward candidates.
- Node2Vec++ Transition Demonstrator Demonstrate weighted node2vec-style transitions with a threshold for strong connections to the previous node.
- Path Cost Single Edge Replacement Term Tool Compute path cost single edge replacement term from explicit bounded inputs.
- Path Edge Count From Vertex Count Tool Count traversed edges in an open vertex sequence or a closed sequence whose first vertex is not repeated at the end.
- Path Terminal Vertex Parity Contribution Count explicit walk-endpoint occurrences and their degree parity contribution, including coincident endpoints.
- PinSage Aggregation Demonstrator Demonstrate PinSage-style importance pooling from random-walk visit counts and node features.
- Rooted Tree Preorder Parent Interval Check Tool Calculate rooted tree preorder parent interval check from explicit caller-supplied inputs.
- Shortest Unweighted Path Finder Breadth-first shortest path between two nodes of an unweighted graph given as an adjacency map; reports the hop count and node sequence, or no path.
- Signed Graph Cycle Edge Parity Update Tool Calculate signed graph cycle edge parity update from explicit caller-supplied inputs.
- Strongly Connected Components Finder Partition a bounded directed graph into canonical strongly connected components and return vertex memberships plus its deduplicated condensation edges using iterative Kosaraju–Sharir searches.
- Tree Center Eccentricity Explicit Gap Tool Calculate tree center eccentricity explicit gap from explicit caller-supplied inputs.
- Tree Degree Excess Check Tool Check the positive-degree and degree-sum conditions for a labeled simple-tree degree sequence; this does not inspect a particular graph's connectivity.
- Tree Leaf Degree Deficit Sum explicit vertex degree deficits 2-degree and count degree-one vertices without certifying that the graph is a tree.
- Tree Leaf Removal Degree Budget Tool Calculate tree leaf removal degree budget from explicit caller-supplied inputs.
- Tree Parent Edge Deficit Tool Compare supplied rooted-forest cardinality witnesses; edge counts alone do not prove a tree or forest.
- Tree Pruned Leaf Height Bound Tool Height bounds after simultaneously removing a subset of original leaves, in edge-height units with empty/singleton height zero.
- Tree Root Depth Parent Step Tool Calculate tree root depth parent step from explicit caller-supplied inputs.
- Tree Root Nonroot Child Degree Budget Tool Compute tree root nonroot child degree budget from explicit bounded inputs.
- Triangle Edge Support Count Tool Count distinct supplied common neighbors supporting one simple undirected edge; no graph reconstruction or symmetry verification.
- Undirected Edge Stub Count Contribution Tool Calculate undirected edge stub count contribution from explicit caller-supplied inputs.
- Vertex Deficiency From Bound Tool Calculate vertex deficiency from bound from explicit caller-supplied inputs.
- Vertex Loop Degree Contribution Tool Return the loop incidence contribution under explicit undirected, single directed in/out, or total directed degree conventions.
- Vertex Neighbor Degree Sum Tool Sum explicitly supplied distinct-neighbor degrees without reconstructing a graph.