Walks are any sequence of nodes and edges in a graph. In this instance, the two nodes and edges can repeat while in the sequence.If there are actually one or more paths between two nodes in the graph, the distance amongst these nodes will be the duration in the shortest route (otherwise, the gap is infinity)Partial Get Relation on a Set A relation