Jump to content

Adjacency matrix

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by TakuyaMurata (talk | contribs) at 05:31, 12 June 2003 (stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In mathematics, adjacency matrix is one of way to represent a graph, particularly using computers.

Each row and column corresponds to one vertix. The matrix has a redundant information because it is symmetric about the main diagonal, which means there are two indentical information in parallel.