Outline ·Graph Concepts Single-source shortest path problem Breadth-first search for unweighted graphs 。 Dijkstra's algorithm for non-negative weightsOutline • Graph Concepts • Single-source shortest path problem • Breadth-first search – for unweighted graphs • Dijkstra’s algorithm – for non-negative weights