In graph theory, a **path** in a graph is a finite or infinite sequence of edges which connect a sequence of vertices which, by most definitions, are all distinct from one another. In a directed graph, a **directed path** (sometimes called **dipath**^{[1]}) is again a sequence of edges (or arcs) which connect a sequence of vertices, but with the added restriction that the edges all be directed in the same direction.

Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts. See e.g. Bondy and Murty (1976), Gibbons (1985), or Diestel (2005). Korte et al. (1990) cover more advanced algorithmic topics concerning paths in graphs.

## Contents

## Definitions[edit]

A walk of length in a graph is an alternating sequence of vertices and edges, , which begins and ends with vertices. If the graph is directed, then is an arc from to . An infinite path is an alternating sequence of the same type described here, but with no first or last vertex, and a semi-infinite path (also ray) has a first vertex, , but no last vertex. Most authors require that all of the edges and vertices be distinct from one another.

A weighted graph associates a value (*weight*) with every edge in the graph. The *weight of a path* in a weighted graph is the sum of the weights of the traversed edges. Sometimes the words *cost* or *length* are used instead of weight.

## Examples[edit]

- A graph is connected if there are paths containing each pair of vertices.
- A directed graph is strongly connected if there are oppositely oriented directed paths containing each pair of vertices.
- A path such that no graph edges connect two nonconsecutive path vertices is called an induced path.
- A path that includes every vertex of the graph is known as a Hamiltonian path.
- Two paths are
*vertex-independent*(alternatively,*internally vertex-disjoint*) if they do not have any internal vertex in common. Similarly, two paths are*edge-independent*(or*edge-disjoint*) if they do not have any internal edge in common. Two internally vertex-disjoint paths are edge-disjoint, but the converse is not necessarily true. - The distance between two vertices in a graph is the length of a shortest path between them, if one exists, and otherwise the distance is infinity.
- The diameter of a connected graph is the largest distance (defined above) between pairs of vertices of the graph.

Several algorithms exist to find shortest and longest paths in graphs, with the important distinction that the former problem is computationally much easier than the latter, unless P=NP. Dijkstra's algorithm produces a list of shortest paths from a source vertex to every other vertex in directed and undirected graphs with non-negative edge weights (or no edge weights), whilst the Bellman–Ford algorithm can be applied to directed graphs with negative edge weights. The Floyd–Warshall algorithm can be used to find the shortest paths between all pairs of vertices in weighted directed graphs.

## See also[edit]

- Glossary of graph theory
- Path graph
- Polygonal chain
- Shortest path problem
- Longest path problem
- Dijkstra's algorithm
- Bellman–Ford algorithm
- Floyd–Warshall algorithm

## References[edit]

- Bondy, J. A.; Murty, U. S. R. (1976).
*Graph Theory with Applications*. North Holland. pp. 12–21. ISBN 0-444-19451-7. - Diestel, Reinhard (2005).
*Graph Theory*(3rd ed. ed.). Graduate Texts in Mathematics, vol. 173, Springer-Verlag. pp. 6–9. ISBN 3-540-26182-6. - Gibbons, A. (1985).
*Algorithmic Graph Theory*. Cambridge University Press. pp. 5–6. ISBN 0-521-28881-9. - Korte, Bernhard; Lovász, László; Prömel, Hans Jürgen; Schrijver, Alexander (Eds.) (1990).
*Paths, Flows, and VLSI-Layout*. Algorithms and Combinatorics 9, Springer-Verlag. ISBN 0-387-52685-4.

This page uses Creative Commons Licensed content from Wikipedia. A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia.