Okay, imagine my nodes as routes.
So if you want to go from level 1 to level 3, you have to pass through 1 level 2 node.
the ending node can be single, or there can be multiple nodes.
Imagine, all nodes are bus stops, and the paths are buses. A bus as 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.
All I want to do is
1. Create a random graph with 1 starting node, and 4-5 levels, with number of points at each level random. Last level can have one or many nodes, no issues here.
2. Print all possible Paths from A to the end nodes
So its more like a tree where you cannot go from the first level to an intermediate level by skipping the levels between the two.