请输入您要查询的字词:

 

单词 EulerPath
释义

Euler path


An Euler path in a graph is a path which traverses each edge of the graph exactly once. An Euler path which is a cycle is called an Euler cycle. For loopless graphs without isolated vertices, the existence of an Euler path implies the connectedness of the graph, since traversing every edge of such a graph requires visiting each vertex at least once.

If a connected graphMathworldPlanetmath has an Euler path, one can be constructed by applying Fleury’s algorithmMathworldPlanetmath. A connected graph has an Euler path if it has exactly zero or two vertices of odd degree. If every vertex has even degree, the graph has an Euler cycle.

This graph has an Euler cycle. All of its vertices are of even degree.

This graph has an Euler path which is not a cycle. It has exactly two vertices of odd degree.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 4:15:14