Find SECOND shortest path in directred graph

I need a way to find second shortest path in directed graph, on top of that second shortest path cannot include the shortest path entirely. I am aware of dijkstra algoritm, but I am unable to figure out a simple way on how to change that algorithm to give me a second shortest path in a reasonable amount of time. Algorithm, sudo-code or c++ example, one of the three will be greatly appreciated.