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.
Asked
Viewed
21 times
0
$\begingroup$
$\endgroup$
-
6$\begingroup$ Exact duplicate of Single-source shortest paths with even weight $\endgroup$ – David Richerby Jun 3 at 17:32
-
$\begingroup$ There is a search bar on the top of every page. Have you tried searching for "single source shortest path even"? $\endgroup$ – Apass.Jack Jun 3 at 17:44
