The shortest path problem is a graph theory concept which involves finding the most efficient route between two vertices in a graph. It can be applied to real-world problems such as finding the shortest route between two intersections on a road map. The edges of the graph are weighted by the length of the segment they represent.
UC Berkeley
Spring 2020
This is an introductory course to computer science theory, exploring the design and analysis of various algorithms, number theory, and complexity. The prerequisites include familiarity with mathematical induction, big-O notation, basic data structures, and programming in a standard language.
No concepts data
+ 36 more concepts