Optimization: principles and algorithms, by Michel Bierlaire
|
Enumerate all simple paths between two nodes. More...
Go to the source code of this file.
Functions | |
function | enumeratePaths (in adj, in arcs, in orig, in dest, in forbiddennodes, in forward) |
Enumerate all simple paths between two nodes. More... | |
Enumerate all simple paths between two nodes.
Definition in file enumeratePaths.m.
function enumeratePaths | ( | in | adj, |
in | arcs, | ||
in | orig, | ||
in | dest, | ||
in | forbiddennodes, | ||
in | forward | ||
) |
Enumerate all simple paths between two nodes.
adj | adjacency matrix of the network. Each nonzero entry corresponds to an arc. The value of the entry is the ID of the arc. |
arcs | matrix containing the upstream and downstream nodes of each arc. Each row corresponds to an arc. Column 1 contains the upstream node and column 2 the downstream. Can be generated from the adjacency matrix by prepareNetwork |
orig | the origin node |
dest | the destination node |
forbiddennodes | nodes that cannot be included anymore, in order to generate simple paths. |
forward | if 0, arcs can be used in any direction. If not 0, arcs can only be used in the forward direction |