Use this graph operation to transform, inspect, classify, or aggregate a graph whose directedness, edge semantics, weights, node identifiers, and duplicate-edge policy are defined.

Adjacency map

Adjacency map from node name to an array of neighbor names.

Directed

Treat listed neighbors as one-directional instead of mutual.

Count each node's degree, in-degree, and out-degree over an adjacency map. The tool evaluates the supplied inputs together and returns the named outputs below; it does not infer omitted operating conditions or change the units shown.^[1]

Degrees

Aligned arrays of node names plus degree, in-degree, and out-degree counts; self-loops add two to an undirected degree.

• Graph results depend on representation and conventions for self-loops, parallel edges, direction, isolated nodes, weights, normalization, and traversal order. Learned embeddings additionally depend on sampling and training parameters.
• Use finite inputs in the displayed units and preserve more precision than the final presentation requires. Independently verify safety-critical, financial, compliance, or production decisions.

Validate node and edge counts before and after transformation, test small known graphs, and preserve an explicit graph schema with algorithm parameters.

• 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.

• Graph Adjacency List to Matrix Converter

  Convert an adjacency map into a square 0/1 matrix with sorted node order.

• 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.