Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03482967n
Noun Concept
Categories: Graph connectivity, Graph theory objects
EN
path  directed path  dipath  Edge independent path  simple path
EN
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. Wikipedia
English:
graph
graph theory
Definitions
Relations
Sources
EN
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. Wikipedia
A sequence of edges of a graph that form a trail Wikipedia Disambiguation
Sequence of edges connecting a sequence of vertices in a graph Wikidata
A route or track between one place to another. OmegaWiki
A sequence of vertices from one vertex to another using the arcs (edges). A path does not visit the same vertex more than once (unless it is a closed path, where only the first and the last vertex are the same). Wiktionary
Graph theory: a sequence of vertices from one vertex to another. Wiktionary (translation)
IS A
concept
trail
HAS KIND
cycle
Hamiltonian path
Eulerian path
DE
Dilatation
random path
+1 relations
Wikipedia
EN
path (graph theory)
Wikidata
EN
path
Wiktionary
EN
path
OmegaWiki
EN
path
Wikipedia Redirections
EN
dipath, directed path, Edge independent path, Path (graph), simple path (graph theory), Vertex independent path, walk (graph theory)
Wikidata Alias
EN
simple path

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License