Path (graph theory)
id:
path-graph-theory-247-14781427
title:
Path (graph theory)
text:
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. A directed path 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 & Mu
brand slug:
wiki
category slug:
encyclopedia
description:
Sequence of edges which join a sequence of nodes on a given graph
original url:
https://en.wikipedia.org/wiki/Path_(graph_theory)
date created:
date modified:
2024-04-12T14:41:51Z
main entity:
{"identifier":"Q1415372","url":"https://www.wikidata.org/entity/Q1415372"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/7/70/Snake-in-the-box_and_Hamiltonian_path.svg","width":349,"height":325}
fields total:
13
integrity:
15