Displaying 2 results from an estimated 2 matches for "nontouching".
2010 May 04
1
All possible paths between two nodes in a flowgraph using igraphs?
...ssible sequence of nodes from i to j
which does not pass through any intermediate node more than once.
- A first-order loop is any closed path in the flowgraph that returns to the
initial node of the loop without passing through any intermediate node more
than once.
- A jth-order loop consists of j nontouching first-order loops.
For example, in the flowgraph below
http://n4.nabble.com/file/n2125321/flowgraph_subsume.jpg
there are 18 paths between nodes 1 and a:
- 1a;
- 12a, 124a, 1243a, 1245a, 12436a, 124365a, 12456a, 124563a;
- 13a, 134a, 136a, 1342a, 1345a, 13456a, 1365a, 13654a, 136542a.
3 first-ord...
2010 May 05
0
R-help Digest, Vol 87, Issue 5
...ssible sequence of nodes from i to j
which does not pass through any intermediate node more than once.
- A first-order loop is any closed path in the flowgraph that returns to the
initial node of the loop without passing through any intermediate node more
than once.
- A jth-order loop consists of j nontouching first-order loops.
For example, in the flowgraph below
http://n4.nabble.com/file/n2125321/flowgraph_subsume.jpg
there are 18 paths between nodes 1 and a:
- 1a;
- 12a, 124a, 1243a, 1245a, 12436a, 124365a, 12456a, 124563a;
- 13a, 134a, 136a, 1342a, 1345a, 13456a, 1365a, 13654a, 136542a.
3 first-ord...