ASSIGNMENT TITLE

Lex/Flex

ROLL NO : 0122-BSCS-2019

SECTION : B
SESSION : 2019-2023
SEMESTER : 5
SUBMIT TO: Dr. ADNAN KHALID

PROJECT PROPOSAL SOFTWARE ENGINEERING

(CS-2105)

DEPARTMENT OF COMPUTER SCIENCE

1
 GC UNIVERSITY, LAHORE, PAKISTAN

1. Introduction
Graph Node Search using BFS and DFS algorithms

2. Objective
Make a GUI based project on BFS and DFS. In which implement both searching
algorithm and find result for both in the same graph. Also be able to draw own graph and
apply BFS and DFS on them and got the results.

3. Problem Description
This problem is about making a GUI application. In which you can make on graph. First
to make nodes on GUI screen then connect them with edges in any random order. You
have to give starting node and ending node. Then apply any algorithm either BFS or DFS
on that graph. And you will get the shortest path between two nodes.

4. Methodology
I will use simpleguitk module for this GCI application. This module allows us to make the
graph on canvas. Canvas is sometimes called a scene graph because it arranges the logical
representation of a user interface or graphical scene. Then I will do necessary coding to
manage the canvas. Like nodes, graph, edges, mouse clicks. I will need to manage buttons for
GUI interface. Buttons like for finding BFS, DFS etc. Then I have to do code for the BFS
and DFS separately. I have to do coding to manage canvas. I have to manage the distance
between nodes and their order while finding the output.

5. Project Scope
This project has the scope to apply BFS and DFS on a number of nodes to find the
shortest path between source node and destination node.
i.

6. Solution Application Areas

This program is useful in finding shortest path between two nodes in graph.

7. Tools/Technology
I will use python language.
VS code for coding.
I will use CodeSkulptor to run my code.

2
A Python GUI application to search for a node in a linked graph using breadth or depth first
search with simpleguitk module. It allows the user to plot the graph on a canvas and link them
together graphically.

Graph Node Search using BFS and DFS algorithms