next next up down toc toc mail

7.3.  Computing Paths from a Matrix Representation

Definition 7.12 (Adjacency Matrix)

Let G = (V, E) be a simple digraph in which V = { [equation] } and the nodes are assumed to be ordered from [equation] to [equation]

The n × n matrix A whose elements [equation] are given by:

[equation]
is called adjacency matrix of the graph G.

Examples:

Page 379

Examples:


back next up down toc toc mail


Created by unroff & hp-tools. © by Hans-Peter Bischof. All Rights Reserved (1998).

Last modified: 27/July/98 (12:14)