7/23/2019 ADS UNIT-2 PPT (2)

1/74

UNIT II

OPTIMISATION ALGORITHMS

Optimization Problems-Graph Search Algorithms-Generic Search-Breadth-First

Search Dijkstras Shortest-Weighted-Path -Depth-First Search-ec!rsi"e Depth-First

Search-#inear Ordering o$ a Partial Order- %et&ork Flo&s and #inear Programming-

'ill (limbing-Primal D!al 'ill (limbing- Steepest Ascent 'ill (limbing-#inear

Programming-ec!rsi"e Backtracking-De"eloping ec!rsi"e Backtracking

Algorithm- Pr!ning Branches-Satis$iabilit)

*F+,(+./+0(S+1* 2+A* S+.(P3456ADS7%*,-**PP,8+ 4/6 1

7/23/2019 ADS UNIT-2 PPT (2)

2/74

Optimization Problems-Graph

Search Algorithms

Generic Search

Breadth First Search Dijkstra9s Shortest Paths Algorithm Depth First Search #inear Order

*F+,(+./+0(S+1* 2+A* S+.(P3456ADS7%*,-**PP,8+ 4/6 2

7/23/2019 ADS UNIT-2 PPT (2)

3/74

Graph

a

c

b %ode : cit) or comp!ter

+dge : road or net&ork

7ndirected or Directed

A s!rprisingl) large n!mber o$ problemsin comp!ter science can be e;pressed

as a graph theor) problem/

*F+,(+./+0(S+1* 2+A* S+.(P3456ADS7%*,-**PP,8+ 4/6 3

7/23/2019 ADS UNIT-2 PPT (2)

4/74

Generic Search-Graph Search

Speci$ication< eachabilit)-$rom-single-so!rces=>pre(ond?post(ond?