Path (graph theory)

A hypercube graph showing a Hamiltonian path in red, and a longest induced path in bold black.

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) 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.

单词	Dipath
释义	Dipath 英语百科 Path (graph theory) 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) 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.
随便看	trigyre trigyric trihaiogen ether trihalid trihalide trihalo acetyl derivative trihaloacetyl derivative trihalogen acid trihalogenated trihalogenated benzene trihalogen ester trihalogen ether trihalogenn ester trihalogenomethane Trihalomethane Trihalomethanes trihaploid trihapto ligand trihedra trihedral trihedral angle trihedral cailbration reflector trihedral prism trihedral reflector trihedral reflector, optical

Dipath

Path (graph theory)