A sequence of edges connecting a sequence of nodes

A path with same start and end point

A path with no repeated edges or nodes

A cycle with no repeated edges or nodes, bar the start/end point

A path that visits every node exactly once

A cycle that visits every node exactly once

All edges in the graph have a specified direction

No edges have a given direction

Some edges are directed, some aren’t

Every node is connected by a single edge to every other node

A path exists between every pair of nodes

In a directed graph every pair of nodes A and B have a path from A to B and from B to A

An Euler path with same start and end point

A path that uses every edge exactly once

In a directed graph the underlying undirected graph is connected

An undirected graph with no cycles

## Show Comments