  In this paper, we consider a continuous-time quantum walk based search
algorithm. We introduce equitable partition of the graph and perfect state
transfer on it. By these two methods, we can calculate the success probability
and the finding time of the search algorithm. In addition, we gave some
examples of graphs that we can calculate the success probability and the
finding time.
