Go backward to ExampleGo up to TopGo forward to Undirected Graph |

*Definition:*
Let `G` = <`V`, `E`> be a directed graph with
|`V`| = `n`. The *adjacency matrix* of `G` is the boolean `n` * `n` matrix
`M` where `M`(`x`, `y`) = __true__ if and only if
<`x`, `y`>
in `E`:

adjacency( G) :=letV=G_{0},E=G_{1}:suchMinVxV-> {true,false}:( forallxinV,yinV:M(x,y) =true<=> <x,y> inE).

*Matrix representation from graph.*

Author: Wolfgang Schreiner

Last Modification: January 26, 2000