# Graph walks and simple paths

This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.

[Catalogue presentation and source-binding data](https://ocme.evemisslab.com/data/i18n/catalogue.en.json)



## [Graph walks and simple paths](https://ocme.evemisslab.com/en/atlas/atlas-graph-walk-simple-path/)

In a finite undirected simple graph, a walk requires each consecutive pair of vertices to be adjacent; a simple path additionally requires all vertices to be distinct.

atlas-graph-walk-simple-path · canonical_mko

[Graph walks and simple paths](https://ocme.evemisslab.com/en/mko/mko-graph-walk-simple-path/)

## Prerequisite nodes


- [Finite simple undirected graphs](https://ocme.evemisslab.com/en/atlas/atlas-graph/)
- [Sequence](https://ocme.evemisslab.com/en/atlas/atlas-sequence/)
- [Binary relations and set projections](https://ocme.evemisslab.com/en/atlas/atlas-relation/)