Given a connected undirected graph G = (V,E), given vertex s in V, i need to find an algorithm that finds the length of the shortest even edge path from each v in V to s. needs to be in theta V + E time complexity. thank you for the help

New contributor
help plz is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.
  • $\begingroup$ You should probably restate this as a question. $\endgroup$
    – JimN
    Commented Jul 9 at 1:15
  • $\begingroup$ 1. What is a "even edge path"? I suggest breaking this down and defining concepts, rather than trying to state in one long sentence. 2. Where did you encounter this? Can you credit the original source? Our site is for research-level questions. This does not appear to be research-level. $\endgroup$
    – D.W.
    Commented Jul 9 at 1:51
  • $\begingroup$ 3. Per our help center: "Questions should be based on knowledge sharing [...] You should only post questions you're actually seriously thinking about. Users are expected to do their part and try to answer their question by themselves before posting them on cstheory and asking for help from others. [...] Try to make your question interesting for others by providing some background knowledge." I suggest showing what progress you've made and the best algorithm you've got so far. $\endgroup$
    – D.W.
    Commented Jul 9 at 1:52


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.