This question already has an answer here:

Given directed graph with non negative weights and vertex s. I need an algorithm that finds shortest paths from s to all vertices and the paths have to be even.


marked as duplicate by David Richerby, Apass.Jack, Evil, dkaeae, xskxzr Jun 4 at 9:12

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.