Adjacency Matrix Maker
Paste graph edges to make a directed, undirected, weighted or unweighted adjacency matrix, inspect adjacency lists and degrees or strengths, and export the result.
Use the Adjacency Matrix Maker
Graph Input
Enter edges on the left and click Build Matrix.
Adjacency Matrix
Adjacency List
Degree Sequence
Matrix convention and privacy
Rows are sources and columns are targets. Parallel edges are summed, and an undirected self-loop appears once on the diagonal but contributes twice to unweighted degree. Weighted totals are labeled strength. Inputs are processed only in this browser and are not uploaded.
References: NetworkX adjacency matrix documentation and Wolfram AdjacencyMatrix documentation.
Copied!
Summary
Paste graph edges to make a directed, undirected, weighted or unweighted adjacency matrix, inspect adjacency lists and degrees or strengths, and export the result.
How it works
- Choose directed or undirected graph mode and enable weights when needed.
- Optionally enter every node to retain isolated vertices.
- Enter edges one per line as "A B" or, in weighted mode, "A B 2.5".
- Click Build Matrix to generate the adjacency matrix.
- Read the N×N grid: each cell is an edge count or accumulated edge weight.
- Inspect the adjacency list and degree or strength totals, then export CSV, LaTeX or Python.
Use cases
- Verify hand-built adjacency matrices for graph theory homework.
- Quickly visualize small graphs for algorithm design or debugging.
- Check degree sequences before applying degree-based theorems.
- Understand directed vs. undirected edge representation side-by-side.
- Prepare data for graph algorithms that require matrix input.
Frequently Asked Questions
Last updated: 2026-09-22 ·
Reviewed by Nham Vu