0% found this document useful (0 votes)

32 views

BFS DFS

The document discusses search tree terminology and graph search strategies. It defines key terms like search tree, fringe, and search strategy. It also explains uninformed and informed search strategies, and how strategies are evaluated based on completeness, time complexity, space complexity, and optimality.

Uploaded by

Fahad Sherwani

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

32 views

BFS DFS

Uploaded by

Fahad Sherwani

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 51

Search Terminology

Search Tree
– Generated as the search space is traversed
• The search space itself is not necessarily a tree, frequently it is a
graph
• The tree specifies possible paths through the search space
– Expansion of nodes
• As states are explored, the corresponding nodes are expanded by
applying the successor function
– this generates a new set of (child) nodes
• The fringe (frontier/queue) is the set of nodes not yet visited
– newly generated nodes are added to the fringe
– Search strategy
• Determines the selection of the next node to be expanded
• Can be achieved by ordering the nodes in the fringe
– e.g. queue (FIFO), stack (LIFO), “best” node w.r.t. some measure (cost)

18
Search Tree Vs Graph Tree
BASIS FOR
TREE GRAPH
COMPARISON
Path Only one between two More than one path is
vertices. allowed.
Root node It has exactly one root Graph doesn't have a
node. root node.
Loops No loops are permitted. Graph can have loops.

Complexity Less complex More complex

comparatively
Traversal techniques Pre-order, In-order and Breadth-first search and
Post-order. depth-first search.

Number of edges n-1 (where n is the Not defined

number of nodes)
Model type Hierarchical Network 19
Example: Graph Search

1
1
A4 D3 3
1 1
5 2
S3 C2 G0
3 3
1 4
B2 E1

• The graph describes the search (state) space

– Each node in the graph represents one state in the search space
• e.g. a city to be visited in a routing or touring problem

• This graph has additional information

– Names and properties for the states (e.g. S3)
– Links between nodes, specified by the successor function
• properties for links (distance, cost, name, ...)
18
Traversing a Graph as Tree  A tree is
generated by
traversing the
graph.
1
1
A4 D3 3  The same node
1 1 in the graph
may appear
5 2 repeatedly in the
S3 C2 G0
3 3 tree.
1 4  The arrangement
B2 2
E1 of the tree
depends on the
traversal strategy
S3 (search method)
1 1
5  The initial state
A4 C2 B2
becomes the root
node of the tree
1 2 3 3 2
1 1  In the fully
D3 C2 D3 G0 E1 C2 4 E1
expanded tree,
the goal states
3 1 2 3 3 4 1 2 3 4 are the leaf
nodes.
G0 D3 G0 E1 G0 G0 D3 G0 E1 G0  Cycles in graphs
3 4 3 4 may result in
19
infinite branches
G0 G0 G0
Kruskal’s Algorithm

Kruskal’s Algorithm includes 4 Steps:

Step 1: List all the edges of the graph in order of

increasing weights.

Step 2: Select the smallest edge of the graph.

Step 3: Select the next smallest edge that do

not makes any circuit.

Step 4: Continue this process until all the

Vertices are explored and (Vn-1) edges have
been selected
Minimum Spanning Tree (MST) Kruskal’s Algorithm
Find MST using Kruskal’s Algorithm
Prim’s Algorithm
Prim’s Algorithm includes 4 Steps:

Step 1: Draw an n by n (n x n) vertices’ matrix and

label them as V1, V2…..Vn along with the given weights
of the edges.

Step 2: Starting from vertex V1 and connect it to its

nearest neighbor by searching in row 1.

Step 3: Consider V1 and Vi as one subgraph and

connect as step 2 while do not forming any circuit.

Step 4: Continue this process until we get the MST

having n vertices and (Vi-1) edges.
Prim’s Algorithm
Find MST using Prim’s Algorithm
Searching Strategies

Uninformed Search
– breadth-first Informed Search
– uniform-cost search – best-first search
– depth-first – search with heuristics
– depth-limited search – memory-bounded search
– iterative deepening – iterative improvement search
– bi-directional search

Most of the effort is often spent on the selection of an

appropriate search strategy for a given problem:
– Uninformed Search (blind search)
• number of steps, path cost unknown
• agent knows when it reaches a goal
– Informed Search (heuristic search)
• agent has background information about the problem
20
– map, costs of actions
Evaluation of Search Strategies
A search strategy is defined by picking the order
of node expansion

Strategies are evaluated along the following

dimensions:
• Completeness: if there is a solution, will it be found
• Time complexity: How long does it takes to find the
solution
• Space complexity: memory required for the search
• Optimality: will the best solution be found

Time and space complexity are measured in

terms of
– b: maximum branching factor of the search tree
– d: depth of the least-cost solution
– m: maximum depth of the state space (may be ∞) 29
1. Breadth-First Search (BFS) Algorithm

30
Breadth-First Search

• It is the most common search strategy for

traversing a tree or graph.

• This algorithm searches breadthwise in a tree

or graph, so it is called breadth-first search.

• BFS algorithm starts searching from the root

node of the tree and expands all the
successor nodes at the current level before
moving to node of next level.

• BFS is implemented using FIFO Queue data

structure.
31
Breadth-First Search

All the nodes reachable from the current node are

explored first (shallow nodes are expanded before deep
nodes).

Algorithm (Informal)
1. Enqueue the root/initial node (Queue Structure).
2. Dequeue a node and examine it.
1. If the element sought is found in this node, quit the search and
return a result.
2. Otherwise enqueue any successors (the direct child nodes) that
have not yet been discovered.
3. If the queue is empty, every node on the graph has been
examined – quit the search and return "not found".
4. Repeat from Step 2.
32
Breadth-First Search

A breadth-first search (BFS)

A explores nodes nearest the root
before exploring nodes further
away on each level
B C
For example, after searching A,
D E F G then B, then C, the search
proceeds with D, E, F, G
H I J K
Node are explored in the Level
order A B C D E F G H I J K L
L M N O P Q MNOPQ

J will be found before N

33
Breadth-First Snapshot 1

1
Initial
Visited
Fringe
2 3 Current
Visible
Goal

Fringe: [] + [2,3]
24
Breadth-First Snapshot 2

1
Initial
Visited
Fringe
2 3 Current
Visible
Goal
4 5