Graph - Path

> (Data|State) Management and Processing > (Data Type|Data Structure) > Graph (Network - Nodes and edges)

1 - About

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 <math>[\{x_1, x_2\}, \{x_2, x_3\}, \{x_3, x_4\}, \dots , \{x_{k_1}, x_k\}]</math> is called a <math>x_1-to-x_k</math> path.

Advertising

3 - Example

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

  • one goes through “Wriston Quad” ,
  • one goes through “Keeney Quad”

4 - Management

4.1 - Shortest

5 - Documentation / Reference