Decomposition of a directed graph into Hamiltonian paths
Finding an Hamilton path in directed (and un-directed) graphs, is an $NP$ complete problem.
Thus, there is probably no efficient algorithm (polynomial) to split a given graph to several hamiltonian paths.