On Computing Top-$k$ Simple Shortest Paths from a Single Source