Shortest path from source to every other node with skip some(W) edges

[faltu112]

I have read one answer on Quora (https://www.quora.com/How-do-I-find-shortest-path-with-the-ability-to-skip-some-edges ) using modified Dijkstra algorithm but can't figure out how to code it in c++. Any help is appreciated.

[nuderobmonkey]

Have you already managed implementing the plain Dijkstra algorithm or need you help with that?