Finding Shortest Path after Meeting in the Middle

Loading...
From the course by University of California San Diego
Algorithms on Graphs
866 ratings
University of California San Diego
866 ratings
Course 3 of 6 in the Specialization Data Structures and Algorithms
From the lesson
Advanced Shortest Paths Project (Optional)

Meet the Instructors

  • Alexander S. Kulikov
    Alexander S. Kulikov
    Visiting Professor
    Department of Computer Science and Engineering
  • Michael Levin
    Michael Levin
    Lecturer
    Computer Science
  • Daniel M Kane
    Daniel M Kane
    Assistant Professor
    Department of Computer Science and Engineering / Department of Mathematics
  • Neil Rhodes
    Neil Rhodes
    Adjunct Faculty
    Computer Science and Engineering

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.