Description
- A Graph consists of a set of nodes, and a set of edges that connect them
Examples
- The graph below has 4 nodes and 5 edges
The Graph above can be expressed by matrix as this :
A
=
[
−
1
1
0
0
−
1
0
1
0
0
−
1
1
0
0
−
1
0
1
0
0
−
1
1
]
A= \left[ \begin{matrix} -1 & 1 & 0 &0& \\ -1 & 0 & 1 &0&\\ 0 & -1 & 1 &0&\\ 0 & -1 & 0 &1&\\ 0 & 0 & -1 &1& \end{matrix} \right]
A=⎣⎢⎢⎢⎢⎡−1−100010−1−100110−100011⎦⎥⎥⎥⎥⎤
- each column represents a node and each row represents an edge.
- 1 means flowing into that node. -1 ,on the contraty ,means flowing out that node
Spanning Trees and Independent Rows
The procession of elimination mostly seems kind of like cut loops .