Return to Concurrency Glossary, Concurrency - Concurrent Programming - Concurrent Computing, Multi-Threaded Programming, Parallelism - Parallel Programming - Parallel Computing, Multi-Threaded Programming - Multi-Core Programming, Asynchronous Programming, Concurrency and Functional Programming, Awesome Concurrency

Adjacency matrix - “A graph representation method that uses a 2D array. Each row and column corresponds to a node from the graph. If an edge exists between two nodes, a 1 value is placed at the intersection of the two nodes; otherwise, a 0 is stored to show that no edge exists.” (ArtConc 2009)

Snippet from Wikipedia: Adjacency matrix

In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph.

In the special case of a finite simple graph, the adjacency matrix is a (0,1)-matrix with zeros on its diagonal. If the graph is undirected (i.e. all of its edges are bidirectional), the adjacency matrix is symmetric. The relationship between a graph and the eigenvalues and eigenvectors of its adjacency matrix is studied in spectral graph theory.

The adjacency matrix of a graph should be distinguished from its incidence matrix, a different matrix representation whose elements indicate whether vertex–edge pairs are incident or not, and its degree matrix, which contains information about the degree of each vertex.

Creative Commons Attribution-Share Alike 4.0

Research:

• Adjacency Matrix on DuckDuckGo
• Adjacency Matrix on O'Reilly
• Adjacency Matrix on GitHub
• Adjacency Matrix on StackOverflow
• Adjacency Matrix on YouTube

Fair Use Sources:

• B002L4EXD8 (ArtConc 2009)