
file  circulationDecomposition.m [code] 
 Algorithm 21.2: circulation decomposition.


file  flowDecomposition.m [code] 
 Algorithm 21.3: flow decomposition.


file  jarnikPrim.m [code] 
 Algorithm 21.4: JarnikPrim.


file  nodeDivergence.m [code] 
 Compute the divergence of a flow vector (Definition 21.13 of [1])


file  prepareNetwork.m [code] 
 Prepares the network for efficient access to the data.


file  run2120.m [code] 
 Runs example 21.20 with the JarnikPrim algorithm for minimum spanning tree (Algorithm 21.4 of [1])


file  runCirculationDecomposition.m [code] 
 Run the circulation decomposition algorithm on the example represented in Figure 21.15 of [1].


file  runDivergence.m [code] 
 Calculate the divergence of the example in Figure 21.10 of [1].


file  runFlowDecomposition.m [code] 
 Run the flow decomposition algorithm on the examples represented in Figures 21.14 and 21.19 of [1].


file  runPrepareNetwork.m [code] 
 Run the function that prepares the network.


file  runSimpleCycle.m [code] 
 Run the algorithm extracting cycle flow vector on the example represented in Figure 21.15 of [1].


file  simpleCycle.m [code] 
 Algorithm 21.1: Generation of a simple cycle flow from a circulation.

