|
Optimization: principles and algorithms, by Michel Bierlaire
|
Algorithm 21.1: Generation of a simple cycle flow from a circulation. More...
Go to the source code of this file.
Functions | |
| function | simpleCycle (in adj, in circ, in printlevel) |
| Extract a simple cycle flow from a circulation. More... | |
Algorithm 21.1: Generation of a simple cycle flow from a circulation.
Implementation of algorithm 21.1 of [1]
Definition in file simpleCycle.m.
| function simpleCycle | ( | in | adj, |
| in | circ, | ||
| in | printlevel | ||
| ) |
Extract a simple cycle flow from a circulation.
| adj | the adjacency matrix of the network. It is a matrix, such that the element at row i and column j corresponds to the id of the arc (i,j). The numbering should be from 1 to n. |
| circ | the circulation flow. It is a vector of . |
| printlevel | If different from 0, the cycle is printed. (Default: 0) |
.