Path (graph theory)
Sequence of edges connecting a sequence of vertices in a graph, with no repeating vertices
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.
Nº Q1415372 ★
Common · Knowledge
Path (graph theory)
Sequence of edges connecting a sequence of vertices in a graph, with no repeating vertices
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.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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. Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts. See e.g. Bondy & Murty (1976), Gibbons (1985), or Diestel (2005). Korte et al. (1990) cover more advanced algorithmic topics concerning paths in graphs.
Text: Wikipédia, CC BY-SA 4.0. · Image: MartinThoma (CC BY 3.0) ·
Related cards
Cycle (graph theory)
In graph theory, non-empty trail in which only the first and last vertices are equal
Nº Q245595 ★★
Graph theory
Study of graphs, which are mathematical structures used to model pairwise relations between objects
Nº Q131476 ★★★★
Shortest path problem
Problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized
Nº Q1058754 ★★
Path dependence
Actions in the present which are constrained by actions in the past
Nº Q1093521 ★★
Complete graph
Simple undirected graph in which every pair of distinct vertices is connected by a unique edge
Nº Q45715 ★
PATH (variable)
Environment variable on Unix-like and MS-DOS-like operating systems
Nº Q817775 ★★