eulerpathsandcircuits内容摘要：
circuit starts at this node, then it must end elsewhere. This is because after we leave the node the first time the node has even degree, and every time we return to the node we must leave it. (On the paired arc.) If a node is odd, and the circuit begins else where, then it must end at the node. This is a contradiction, since a circuit must end where it began. Euler Circuit? If a graph has all even degree nodes, then an Euler Circuit exists. Algorithm: Step One: Randomly move from node to node, until stuck. Since all nodes had even degree, the circuit must have stopped at its starting point. (It is a circuit.) Step Two: If any of the arcs have not been included in our circuit, find an arc that touches our partial circuit, and add in a new circuit. Each time we add a new circuit, we have included more nodes. Since there are only a finite numbe。阅读剩余 0%
本站所有文章资讯、展示的图片素材等内容均为注册用户上传(部分报媒/平媒内容转载自网络合作媒体)，仅供学习参考。
用户通过本站上传、发布的任何内容的知识产权归属用户或原始著作权人所有。如有侵犯您的版权，请联系我们反馈本站将在三个工作日内改正。