Shortest path from source to destination in directed acyclic graph
If your algorithm runs in $O(V+E)$ time, and their algorithm runs in $O(V+E)$ time, I don't see any basis for calling your approach more efficient.  At least, asymptotic running time does not seem precise enough to determine which will be more efficient in practice.