I am trying to find the top ten most travelled paths for a cyclic graph that go from start to contact or start to not contact. I have weights for each branch. I can probably
