the U-track and strictly directed bipartite graph are defined. A sufficicent and necessary condition for digraph having Hamiltonian path by use of the defintion of U-track and a sufficient condition for strictly directed bipartite graph to be hamiltonian by use of the definition of Hamiltonian path are proved.