Scribd
Upload
98 views

Lab 4 Ai

1. The document describes exercises involving graph search algorithms breadth-first search (BFS) and depth-first search (DFS). 2. It provides sample code to find the path from node "Sara" to node "Uzma" in a social network graph using BFS, returning the path and complexity. 3. For another graph representing a board game, it uses DFS to find the path from node 1 to 9 and displays the path. 4. For a third larger graph, it compares using BFS and DFS to find the path from node "0" to node "20", calculating the complexity of each in terms of steps and determining which is more efficient.

Uploaded by

Atif Jalal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
98 views

Lab 4 Ai

1. The document describes exercises involving graph search algorithms breadth-first search (BFS) and depth-first search (DFS). 2. It provides sample code to find the path from node "Sara" to node "Uzma" in a social network graph using BFS, returning the path and complexity. 3. For another graph representing a board game, it uses DFS to find the path from node 1 to 9 and displays the path. 4. For a third larger graph, it compares using BFS and DFS to find the path from node "0" to node "20", calculating the complexity of each in terms of steps and determining which is more efficient.

Uploaded by

Atif Jalal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Department of Computer Science CSL-411: Artificial Intelligence Lab

Bahria University, Karachi Campus Semester 06 (Fall 2019)


Atif Jalal
02-235191-027

Lab04: BFS and DFS

Exercises

Exercise 1

Consider the following Facebook network, Draw the graph for the following network.
 Each person’s account is consider as a node in a graph.
 Amina is mutual friend of Sara and Razi
 Razi is mutual friend of Ali and Ahmed.
 Ahmed is mutual friend of Amina and Ahsan.
 Rida is mutual friend of Hassan and Taha.
 Uzma is mutual friend of Ahsan and Taha.
 Distance of each link in 1.
Suppose Sara wants to communicate a message to Uzma. Apply appropriate search algorithm to find
path between Sara and Uzma and display the path.

Python Code Using BFS:


from queue import Queue;
graph = {
"Amina" : ["Sara", "Razi", "Ahmed"],
"Sara" : ["Amina"],
"Razi" : ["Amina", "Ali", "Ahmed"],
"Ali" : ["Razi"],
"Ahmed" : ["Amina", "Ahsan", "Razi"],
"Ahsan" : ["Ahmed", "Uzma"],
"Rida" : ["Hassan", "Taha"],
"Hassan" : ["Rida"],
"Taha" : ["Rida", "Uzma"],
"Uzma" : ["Ahsan", "Taha"]
}

visited = {}
level = {}
parent = {}
bfs_traversal_output = []
queue = Queue()
for node in graph.keys():
visited[node] = False
level[node] = -1
parent[node] = None

s = "Sara"
visited[s] = True
level[s] = 0
queue.put(s)

while not queue.empty():


u = queue.get()
bfs_traversal_output.append(u)

for v in graph[u]:
if not visited[v]:
visited[v] = True
parent[v] = u
level[v] = level[u] + 1
queue.put(v)

v = "Uzma"
path = []
while v is not None:
path.append(v)
v = parent[v]

path.reverse()
print("Using Breath First Search")
print(path)
print("Complexity")
print(level["Uzma"])
Output:
Exercise 2

Consider the following board game and show the graph for the following board.
 Each block is considered as a node of graph.
 Pacman is standing at the initial position that is, Node 1 and it has to reach the final position
that is, Node 9 to end the game.
 Pacman can only move 1 step forward in vertical or horizontal direction. Diagonal moves are
not allowed.
 Pacman can move forward but can’t come back. Example: From node 2 move to node 3 or 5
but can’t move to node 1.
 Cost or weight of moving is same for each node that is 1.

By using appropriate searching algorithm, help Pacman to reach the destination. And Display the
path from 1 to 9.

Python Code :
graph ={1: set([2,4]),2: set([1,3,5]),3: set([2,4]),4: set([3,5,9]),5: set([2,4,6,8]),6: set([1,5,7]),7:
set([6,8]),8: set([5,7,9]),9: set([4,8])}
def dfs_paths(graph, start, goal):
stack = [(start, [start])]
while stack:
(vertex, path) = stack.pop()
for next in graph[vertex] - set(path):
if next == goal:
yield path + [next]
else:
stack.append((next, path + [next]))
lst = list(dfs_paths(graph,1,9))
lst.sort()
for one in lst:
print(one, end='\n')
Output:
Exercise 3

Apply above network using dictionaries and perform coding for following tasks. Perform DFS search
from node “0” to node “20” and calculate time (in sec) complexity in terms of steps. (Consider every
step take 1 sec). Use BFS algo for the same route, from node “0” to node “20”, calculate complexity
as well and provide a proper comparative analysis on, which algorithm is generating best results in
term of complexity on given route and why?

Python Code Using BFS:


from queue import Queue;
graph = {
"0" : ["1", "3", "16"],
"1" : ["0", "9"],
"2" : ["3", "7", "8", "9"],
"3" : ["0", "2", "6", "9"],
"4" : ["5", "6", "9"],
"5" : ["4", "9"],
"6" : ["3", "4"],
"7" : ["2", "9"],
"8" : ["2", "9"],
"9" : ["1", "2", "3", "4", "5", "7", "8", "10", "11", "15", "18", "19", "20"],
"10" : ["9", "11"],
"11" : ["9", "10", "12", "13"],
"12" : ["11", "13"],
"13" : ["11", "12"],
"14" : ["15", "16"],
"15" : ["9", "14", "16", "17", "18"],
"16" : ["0", "14", "15", "17", "19"],
"17" : ["15", "16", "18"],
"18" : ["9", "15", "17"],
"19" : ["9", "16", "20"],
"20" : ["9", "19"]
}
visited = {}
level = {}
parent = {}
bfs_traversal_output = []
queue = Queue()

for node in graph.keys():


visited[node] = False
level[node] = -1
parent[node] = None

s = "0"
visited[s] = True
level[s] = 0
queue.put(s)

while not queue.empty():


u = queue.get()
bfs_traversal_output.append(u)

for v in graph[u]:
if not visited[v]:
visited[v] = True
parent[v] = u
level[v] = level[u] + 1
queue.put(v)
print("Using Breath First Search")
v = "20"
path = []
while v is not None:
path.append(v)
v = parent[v]
path.reverse()
print(path)
print("Complexity")
print(level["20"])
Output:

You might also like