1.2.6 Chained lists

Next: 2. Managing graphs Up: 1.2 Various representations of Previous: 1.2.5 Node-node matrix

1.2.6 Chained lists

Another representation used by some algorithms is given by the chained lists . This representation uses four vectors, fe, che, fn and chn which are described below:
e1=fe(i)) is the number of the first edge starting from node i
e2=che(e1) is the number of the second edge starting from node i
e3=che(e2) is the number of the third edge starting from node i
and so on until the value is 0
fn(i) is the number of the first node reached from node i
chn(i) is the number of the node reached by edge che(i).

All this can be more clearly seen on figure 2.

**Figure 2:** Chained lists representation of graphs
$\begin{figure}\begin{center}% \begin{picture} (0,0)% \epsfig{file=chain.pstex} %... ...ult}{\mddefault}{\updefault}e3=che(e2)}}} \end{picture}\end{center} \end{figure}$

You can use the chain_struct function to obtain the chained lists representation of a graph from the adjacency lists representation (see 1.2.3).

Next: 2. Managing graphs Up: 1.2 Various representations of Previous: 1.2.5 Node-node matrix

Scilab Group