Scribd
Upload
10K views

HAMITONIAN CIRCUITS (Using Backtracking Method)

The document discusses Hamiltonian circuits and the backtracking method for finding them. It defines Hamiltonian circuits as closed walks that visit each vertex exactly once, except the starting vertex. Backtracking is described as a depth-first search technique that constructs a state-space tree by considering the next possible choice at each step without violating constraints. An algorithm for backtracking is provided. An example of finding a Hamiltonian circuit in a graph using backtracking is shown. Hamiltonian circuits are also related to the traveling salesman problem (TSP). The key differences between Hamiltonian and Eulerian circuits are outlined.

Uploaded by

manas_kumar_23
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
10K views

HAMITONIAN CIRCUITS (Using Backtracking Method)

The document discusses Hamiltonian circuits and the backtracking method for finding them. It defines Hamiltonian circuits as closed walks that visit each vertex exactly once, except the starting vertex. Backtracking is described as a depth-first search technique that constructs a state-space tree by considering the next possible choice at each step without violating constraints. An algorithm for backtracking is provided. An example of finding a Hamiltonian circuit in a graph using backtracking is shown. Hamiltonian circuits are also related to the traveling salesman problem (TSP). The key differences between Hamiltonian and Eulerian circuits are outlined.

Uploaded by

manas_kumar_23
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 15

HAMITONIAN CIRCUITS (using backtracking method)

05/15/12

Agenda
Definition of Hamiltonian Definition of backtracking method Backtracking algorithm Example (using backtracking method) Relationship between Hamiltonian and Tsp Euler an circuit versus Hamiltonian circuit Conclusion References
05/15/12 2

Definition
A hamiltonian circuit in a connected graph defined as a closed walk that traverse every vertex of G exactly once except the starting vertex at which the walk also terminate A graph possessing a hamiltonian circuit is said to be a hamiltonian graph. The hamiltonian circuit is names after sir William Rowan Hamilton

05/15/12

Definition
Backtracking constructs its state-space tree in the depthfirst search fashion in the majority of its applications If the sequence of choices represented by a current node of the state-space tree can be developed further without violating the problems constraints It is done by considering the first remaining legitimate option for the next component of the partially built solution and replace it by the next alternative
05/15/12 4

Backtracking algorithm
Algorithm backtracking(X[1..i])
i=0; X[10] \ it reprints the empty tuple //Given a template of a generic backtracking algorithm //Input : X[1i] specifies first I promising components of a solution //Output: All the tuples representing the problems solutions

05/15/12

Continue
If X[1i] is a solution write X[1..i] Else For each element x S i+1 consistent with X[1..i] and the constraints Do X[i..1] x Backtrack (X[1i + 1] )

05/15/12

EXAMPLE FOR HAMILTON CIRCUIT (USING BACKTRACKING METHOD)

a c d

b f e

05/15/12

CONTINUE
a b f c e d e c e d Dead end f Dead end
05/15/12

f Dead end

d a Found
8

RELATION BETWEEN HAMILTON AND TSP


An optimal Hamilton circuit of a graph is one with the smallest possible weight. There can be more than one. The problem of finding an optimal Hamilton circuit in a complete weighted graph is often called TSP(Traveling salesman problem). Commonly referred to as a TSP it simulates a salesman who must visit each node preferably once go home at the end of the day and have traveled the least distance needed. Any path the salesman
05/15/12

takes is a Hamiltonian circuit.

Eulerian circuit versus Hamiltonian circuit


An eulerian circuit passes along each edge once and only once both are useful in application the Hamiltonian circuit when it is required to visit each vertex and the eulerian circuits when it is required to travel along all the connecting edges.

Euler an circuit not a Hamiltonian

Hamiltonian circuit but not a euler an

05/15/12

10

Eulerian circuit versus Hamiltonian circuit


Condition for there to be Euler an circuits are well know but in general it is a difficult problem to decide when a given graph has a Hamiltonian circuit. Finding condition for the existence of Hamiltonian circuit is an unsolved problem. The degree of the vertex is the number of edges joining onto that vertex, and vertices are said to be odd or even. Euler circuit exist only in networks where there are no odd vertices, that is where all the vertices have an even number of edges ending there.
05/15/12 11

Knight queue
Is a chess piece that can be move either to spaces horizontal one space vertical or one space horigentally and two space vertically. Knight on square (x,y) can move to any of the eight squares(x
1 5 9 13 2 6 10 14 3 7 11 15 4 8 12 16

05/15/12

12

Knight tour is a sequence of legal moves by a knight starting at some square and visiting each square exactly once. A knight tour is a i.e reentrant if there is a legal move that take the knight from the last square of the tour back to where the tour begin. We draw the chess board and move of knight as a graph i.e all cells numbers 1 to 16 are vertices say vi & vj are adjecent if knight could reach jth cell from the ith cell. 05/15/12 13

REFERENCES

Kenneth H Rosen, 6th edition Anany levitin Elements of descrete mathematics, 2nd edition.

05/15/12

14

THANK YOU

05/15/12

15

You might also like