How many vertices can you visit in a given distance in a closed walk

33 Views Asked by At

As the title says. Given a distance and a starting vertex, how many vertices can you visit in a closed walk. This is for work and right now the only solution I have is brute force calculating all closed walks less than or equal to the distance, so any ideas are more than welcome. Finite graph, weighted edges.