construct the adjacency matrix of a graph
graph or network
Important: The networks package has been deprecated. Use the superseding command GraphTheory[AdjacencyMatrix] instead.
Two vertices are said to be adjacent if one or more edges connect them. This routine constructs an adjacency matrix whose rows and columns are indexed by the vertices and whose i-jth entry is the number of edges from vertex i to vertex j.
This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[adjacency](...).
G ≔ cycle⁡4:
G ≔ complete⁡4:
Download Help Document
What kind of issue would you like to report? (Optional)
Thank you for submitting feedback on this help document. Your feedback will be used
to improve Maple's help in the future.