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 matrix

Square matrix of zeros and ones; entry [i][j]=1 marks the edge i to j.

Node names

One name per row; defaults to zero-based positional names.

Convert a square 0/1 adjacency matrix into an adjacency map of sorted neighbor lists. 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]

Adjacency map

Adjacency map with sorted neighbor arrays.

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

• Graph Adjacency List to Matrix Converter

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

• Graph Edge List Normalizer

  Canonicalize an adjacency map into sorted unique nodes and a deterministic deduplicated edge list.

• Connected Components Finder

  Label the weakly connected components of a graph over an adjacency map.