Scribd
Upload
50 views

Graphs: Shortest Paths: Atul Gupta

This document discusses algorithms for finding shortest paths in graphs. It introduces Dijkstra's algorithm and Bellman-Ford algorithm, both of which work by relaxing edges to iteratively find shorter paths. Dijkstra's algorithm is faster but only works on graphs without negative edge weights, while Bellman-Ford can handle negative weights but not negative cycles. The document provides pseudocode for the algorithms and examples of their use.

Uploaded by

harry_i3t
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
50 views

Graphs: Shortest Paths: Atul Gupta

This document discusses algorithms for finding shortest paths in graphs. It introduces Dijkstra's algorithm and Bellman-Ford algorithm, both of which work by relaxing edges to iteratively find shorter paths. Dijkstra's algorithm is faster but only works on graphs without negative edge weights, while Bellman-Ford can handle negative weights but not negative cycles. The document provides pseudocode for the algorithms and examples of their use.

Uploaded by

harry_i3t
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

CS 306 DAA, IIITDM Jabalpur

Graphs: Shortest Paths


Atul Gupta

Problems Specific with Graphs


Minimum Spanning Tree Path Problems
Simple Paths Shortest Path Problem
Single source shortest paths All-pair shortest paths

Find Cycles Euler Path and Circuit Problem Hamiltonian Path and Circuit Problem (or TSP)

Graph Coloring Connected Components Isomorphic graphs Search Graphs

CS 306 DAA, IIITDM Jabalpur

Shortest Path
Given a weighted graph G(V, E) with weight function w: E R Weight w(p) of path p (v0, v1, v2, , vk) is given by

A shortest path between two nodes will be a path with minimum w(p)

Single Source Shortest Paths

CS 306 DAA, IIITDM Jabalpur

Shortest Paths
Main Idea: Relaxing edges in the graph
Two cases

(a)

(b)

Relaxing an Edge (u, v) in the Graph

CS 306 DAA, IIITDM Jabalpur

Main Components of Shortest Path Algorithms

Dijkestras Algorithm

CS 306 DAA, IIITDM Jabalpur

Dijkestras SP vs. Prims MST


MST-PRIM(G, w, r) 1 for each u G.V do 2 key[u] 3 [u] NIL 4 key[r] 0 5 Q = G.V 6 while Q do 7 u EXTRACT-MIN(Q) 8 for each v Adj[u] do 9 if v Q and w(u, v) < key[v] 10 then [v] u 11 key[v] w(u, v)

An Example: Dijkestras Algo

CS 306 DAA, IIITDM Jabalpur

Negative Weight Edges

Stacks

11

Negative Weight Edges and Cycles


If a graph contains a "negative cycle", i.e., a cycle whose edges sum to a negative value, then walks of arbitrarily low weight can be constructed, i.e., there may be no shortest path If a graph contains no negative cycle but some edges with negative weights, Bellman-Ford algorithm will be useful Bellman-Ford algorithm can also detect negative cycles and report their existence

CS 306 DAA, IIITDM Jabalpur

Bellman-Ford Algorithm

Example: Bellman-Ford Algo

CS 306 DAA, IIITDM Jabalpur

Summary
Here we presented two algorithms for single source shortest paths
Dijkestras Bellman-Fords

Both make use of Edge Relaxation approach Dijkestras algorithm is faster but can not be used with graphs having negative weight edges Bellman-Fords algorithm can work with graphs having negative weight edges but not the negative cycles The Dijkestra algorithm is an example of greedy approach.

Cormens Book

You might also like