AdjacencyMatrix
AdjacencyMatrix[g]
gives the SparseArray object representing the graph g.
AdjacencyMatrix[g,n]
gives the SparseArray object representing the graph g, adding additional unconnected vertices, if necessary, to create a graph with n vertices.
Details and Options
- AdjacencyMatrix functionality is now available in the built-in Wolfram Language function AdjacencyMatrix.
- To use AdjacencyMatrix, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
- The graph g can be specified by a rule list, an adjacency matrix, or the Combinatorica representation of a graph.
- The rows/columns of the SparseArray object correspond to vertices in the order returned by VertexList[g].
Examples
open allclose allBasic Examples (2)
The adjacency matrix of a graph specified by a rule list:
This function has been superseded by AdjacencyMatrix in the Wolfram System:
Scope (2)
The SparseArray representation of a graph specified by a rule list:
This adds an extra row and column to the adjacency matrix, corresponding to unconnected vertices:
Properties & Relations (2)
This gives a SparseArray representation of a graph specified by a Combinatorica object:
This shows the MatrixPlot of the adjacency matrix of a GridGraph, and its graph drawing:
Text
Wolfram Research (2007), AdjacencyMatrix, Wolfram Language function, https://reference.wolfram.com/language/GraphUtilities/ref/AdjacencyMatrix.html.
CMS
Wolfram Language. 2007. "AdjacencyMatrix." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/AdjacencyMatrix.html.
APA
Wolfram Language. (2007). AdjacencyMatrix. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/GraphUtilities/ref/AdjacencyMatrix.html