Walks are any sequence of nodes and edges inside a graph. In such cases, both of those nodes and edges can repeat inside the sequence. Two edges are claimed to get adjacent If they're linked to precisely the same vertex. There is absolutely no identified polynomial time algorithm These ideas https://williami284llm0.wikipresses.com/user