An Euler trail is a walk that uses every edge of a graph exactly once.An Euler circuit is a circuit that uses every edge of a graph exactly once.A Euler trail with same endpoints is a Euler circuit.Here are some examples:Letbe a finite co..
Prove that for , .Intuition: Suppose n people shake hands with other people in the group. They don't shake hands twice with the same person.How many handshakes take place?각 사람을 노드로 본다면 두 사람이 악수를 하면 그 두 노드 사이에 Edge 가 생긴다.전체 악수의 수 = N..
When designing an algorithm, ask yourself : For which cases does the obvious method work?Then find a new way to tackle the remaining cases!예제)Find a hamiltonian path through a tournament graph.Using a more-of-input approach, we claim to have a solu..
- Proof of Correctness
- Two Pointer