Imagine, all nodes are bus stops, and the paths are buses. A bus has to stop at all nodes it passes through. So when going from level 1 to level 5, it has to pass through 1 node of each intermediate level.?? But buses don't work like that. Buses don't choose between stopping at B1 or B2.
Well, maybe the 45 does. I always try to avoid the 45.
In reply to Re^3: Print all possible paths in a graph and some graph creation too!
by wol
in thread Print all possible paths in a graph and some graph creation too!
by tsk1979
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |