The efficiency of finding the k shortest paths in this tree lies in the book-keeping of edges through a binary heap that allows for an implicit representation of paths.
the overall performance of the algorithm is efficient even for large k. it is feasible to use in situations where we want to generate a large number of paths, i.e.