Path (graph theory)
In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction.
- Comment
- enIn graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction.
- Depiction
- Has abstract
- enIn graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all 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.
- Hypernym
- Sequence
- Is primary topic of
- Path (graph theory)
- Label
- enPath (graph theory)
- Link from a Wikipage to an external page
- archive.org/details/graphtheorywitha0000bond/page/12
- books.google.com/books%3Fid=vaXv_yhefG8C
- www.math.uni-hamburg.de/home/diestel/books/graph.theory/
- archive.org/details/pathsflowsvlsila0000unse
- Link from a Wikipage to another Wikipage
- Algorithm
- Bellman–Ford algorithm
- Category:Graph connectivity
- Category:Graph theory objects
- Connectivity (graph theory)
- Dijkstra's algorithm
- Directed graph
- Distance (graph theory)
- Edge (graph theory)
- End (graph theory)
- File:Snake-in-the-box and Hamiltonian path.svg
- File:Trail but not path.svg
- Floyd–Warshall algorithm
- Glossary of graph theory
- Graph (discrete mathematics)
- Graph theory
- Hamiltonian path
- Induced path
- Longest path problem
- Path graph
- Polygonal chain
- Self-avoiding walk
- Sequence
- Shortest-path graph
- Shortest path problem
- Strongly-connected digraph
- Vertex (graph theory)
- Weighted graph
- SameAs
- Camí (teoria de grafs)
- Caminho (teoria dos grafos)
- Camino (teoría de grafos)
- Cesta (graf)
- Cesta (teória grafov)
- Chaîne (théorie des graphes)
- Drum (teoria grafurilor)
- m.02zh30
- Path (graph theory)
- Q1415372
- RPzj
- Ścieżka (teoria grafów)
- Staza (teorija grafova)
- Weg (Graphentheorie)
- Đường đi (Lý thuyết đồ thị)
- Шлях (теорія графів)
- מסלול (תורת הגרפים)
- رستہ (نظریہ گراف)
- مسیر (نظریه گراف)
- பாதை (கோட்டுருவியல்)
- วิถี (ทฤษฎีกราฟ)
- 道 (グラフ理論)
- 道路 (图论)
- 경로 (그래프 이론)
- Subject
- Category:Graph connectivity
- Category:Graph theory objects
- Thumbnail
- WasDerivedFrom
- Path (graph theory)?oldid=1124188559&ns=0
- WikiPageLength
- 9676
- Wikipage page ID
- 638889
- Wikipage revision ID
- 1124188559
- WikiPageUsesTemplate
- Template:Authority control
- Template:Cite book
- Template:For
- Template:Interwiki extra
- Template:Nowrap begin
- Template:Nowrap end
- Template:Reflist
- Template:Sfn
- Template:Short description
