We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  • Practice
  • Certification
  • Compete
  • Career Fair
  • Hiring developers?
  1. Practice
  2. Algorithms
  3. Graph Theory
  4. Dijkstra: Shortest Reach 2
  5. Discussions

Dijkstra: Shortest Reach 2

Problem
Submissions
Leaderboard
Discussions
Editorial

Sort 425 Discussions, By:

votes

Please Login in order to post a comment

  • devneal 5 years ago+ 0 comments

    Please make sure you guys are accounting for duplicate edges... don't make my mistake.

    103|
    Permalink
  • DeepanshuBhatti 5 years ago+ 0 comments

    Guys, after each test case print a new line

    37|
    Permalink
  • mdakan 4 years ago+ 0 comments

    I keep timing out on Test Case #7. In Java I'm using an arraylist of hashmaps to keep track of the edge weights, and a priority queue of neighbor vertices to select which to visit next.

    Any general advice how to get it to perform faster? Let me know if I should just post the code.

    35|
    Permalink
  • thisisabhash 5 years ago+ 0 comments

    Don't forget to print -1 for unreachable nodes instead of some max value.

    33|
    Permalink
  • ali_sezgin_cs 4 years ago+ 0 comments

    Test case #7 times out. It seems like noone in the recent past has suffered from the same anomaly. Posting to say that if a similar thing is happening to your implementation, you are not alone. :)

    20|
    Permalink
Load more conversations

Need Help?


View editorial
View top submissions
  • Contest Calendar
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature