Documente Academic
Documente Profesional
Documente Cultură
Project Presentation
Submitted to :
Husne Farah
Lecturer
Dept. of CSE
The People’s University of Bangladesh, Dkaka-1207.
Submitted by:
Group 11:
Ilias Ahmed, ID #16339202142.
Mohammad Saiful Islam, ID #16339202030.
Mohammad Mosharaaf Hossain, ID #16339202141.
Md. Alauddin, ID #16339202029. 1
Problem Solving by Searching
Search Methods :
Breadth-First-Search
Depth-First-Search
Best-First-Search
2
BFS:- Breadth first search
BFS is a graph search algorithm that begins at the root node and
explores all the neighbouring nodes. Then for each of those nearest
nodes, it explores their unexplored neighbour nodes, and so on, until it
finds the goal. It is implemented by using queue.
B C D
E F
Status=1(ready)
Status=2(waiting)
Status=3(processed)
3
L0 A
L1 B C D
E F
L2
Status=1
Status=2
Status=3
QUEUE
A
OUTPUT
4
L0 A
L1 B C D
E F
L2
Status=1
Status=2
Status=3
QUEUE
B C D
OUTPUT
A 5
L0 A
L1 B C D
E F
L2
Status=1
Status=2
Status=3
QUEUE
C D E
OUTPUT
A B 6
L0 A
L1 B C D
E F
L2
Status=1
Status=2
Status=3
QUEUE
D E F
OUTPUT
A B C 7
L0 A
L1 B C D
E F
L2
Status=1
Status=2
Status=3
QUEUE
E F
OUTPUT
A B C D 8
L0 A
L1 B C D
E F
L2
Status=1
Status=2
Status=3
QUEUE
F
OUTPUT
A B C D E 9
L0 A
L1 B C D
E F
L2
Status=1
Status=2
Status=3
QUEUE
OUTPUT
A B C D E F 10
A
B C D
E F
11
Algorithm of BFS:-
14
DFS:- Depth first search
DFS is an uninformed search that progresses by expanding the first
child node of the search tree that appears and thus going deeper and
deeper until a goal node is found, or until it hits a node that has no
children. Then the search backtracks, returning to the most recent node
it has not finished exploring. It is implemented using a stack.
B C D
E F G
I J
15
Stack
B C D
E F G
I J
A
Output
16
Stack
B C D
E F G
B
I J
C
D
Output
A
17
Stack
B C D
E F G E
F
I J
C
D
Output
A B
18
Stack
B C D
E F G I
F
I J
C
D
Output
A B E
19
Stack
B C D
E F G
F
I J
C
D
Output
A B E I
20
Stack
B C D
E F G
J
I J
C
D
Output
A B E I F
21
Stack
B C D
E F G
I J
C
D
Output
A B E I F J
22
Stack
B C D
E F G
I J
D
Output
A B E I F J C
23
Stack
B C D
E F G
I J
G
Output
A B E I F J C D
24
Stack
B C D
E F G
I J
Output
A B E I F J C D G
25
A
B C D
E F G
I J
26
Algorithm of DFS:-
Time complexity
Since in the worst case depth-first search has to consider all
paths to all possible nodes the time complexity of depth-first
search is O(bd).
Completeness
Depth-first search is not complete.
Optimality
Depth-first search is not optimal.
28
Applications of DFS:-
• Topological sorting.
29
Best-First Search:-
30
Algorithm :-
31
S
5
2
6
C B A
13 10
14 8
7
G F E D
5
H 6
I
1 0 1
6
M L K
J
32
Open : Close :
S {}
A(2),C(5),B(6) s
C(5),B(6),E(8),D(10) S,A
B(6),H(7),E(8),D(10) S,A,C
H(7),E(8(,D(10) ,G(13),G(14) S,A,C,B
I(8),J(6),E(8),D(10),F(13),G(14) S,A,C,B,H
L(0),M(1),K(1),J(6),E(8),D(10),F(13),G(14) S,A,C,B,H,I
M(1),K(1),J(6),…………………..G(14)
33
34