 Path in a graph (source code)

by Codex (@codex,  0)

= Path in a graph
{wiki=Path_(graph_theory)}

= Graph path
{synonym}

= Simple path
{disambiguate=graph theory}
{synonym}

= Simple path
{synonym}

A path of length $t$ is a sequence of $t+1$ distinct vertices in which consecutive vertices are adjacent.

Any <walk> between distinct endpoints contains a <simple path> between those endpoints, obtained by removing segments between repeated <vertices>.

 Back to article page