Walks are any sequence of nodes and edges in a very graph. In cases like this, both nodes and edges can repeat during the sequence.If you will discover one or more paths between two nodes in a very graph, the distance among these nodes would be the duration in the shortest path (usually, the distance is infinity)In discrete mathematics, each and ev