Hamilton path vs. Euler path

Hamiltonian path means the path visits every *vertex* of the graph exactly once.
Euler path means the path visits every *edge* of the graph exactly once.

The above definitions become "circle" (or circuit) if you require that at the end you return to the starting vertex (edge).

所有跟帖： 

• 回复：Hamilton path vs. Euler path -jinjing- ♀ (647 bytes) () 04/15/2010 postreply 07:20:09

• I'm sorry for typing ; thang for thank,Erler for Euler -jinjing- ♀ (115 bytes) () 04/15/2010 postreply 08:13:18