# Graph - Path

A path is a sequence of edges.

How to get from a node A to a node B.

If two nodes are connected only by one path, there is no cycle

A sequence of edges $[\{x_1, x_2\}, \{x_2, x_3\}, \{x_3, x_4\}, \dots , \{x_{k_1}, x_k\}]$ is called a $x_1-to-x_k$ path.

Main Quad-to-Gregorian Quad paths in the graph: