复习discrete math 看了老师的课件感觉不靠普,在百度上也找不到好的科普贴,
只能从国外的网站上扒下来生肉,看英文贴还是挺舒服的= =
所以直接:点击打开链接
Introduction
- Euler's Theorems are examples of existence theorems
- existence theorems tell whether or not something exists (e.g. Eulercircuit)
- but doesn't tell us how to create it!
- we want a constructive method for finding Euler paths and circuits
- methods (well-defined procedures, recipes) for construction are calledalgorithms
- there is an algorithm for constructing an Euler circuit: Fleury'salgorithm
- we will illustrate it with the graph: