Scribd
Upload
6 views6 pages

REPORT_DS

The report discusses Breadth-First Search (BFS), a key algorithm for graph traversal that explores nodes layer by layer. It outlines the mechanism of BFS, its applications in fields like networking and artificial intelligence, and its advantages over other traversal methods. The report also highlights challenges related to memory consumption and suggests future optimizations for improved efficiency.

Uploaded by

Sanika Deshmukh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views6 pages

REPORT_DS

The report discusses Breadth-First Search (BFS), a key algorithm for graph traversal that explores nodes layer by layer. It outlines the mechanism of BFS, its applications in fields like networking and artificial intelligence, and its advantages over other traversal methods. The report also highlights challenges related to memory consumption and suggests future optimizations for improved efficiency.

Uploaded by

Sanika Deshmukh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Cummins College of Engineering for Women, Nagpur

Approved by AICTE & Affiliated to RTMNU, Nagpur

DEPARTMENT OF COMPUTER ENGINEERING


2024-2025
B.Tech. IInd YEAR
CO BASED GROUP ACTIVITY

NAME OF ACTIVITY: REPORT / ARTICLE WRITING


TOPIC OF ACTIVITY: BREADTH FIRST SEARCH
SUBJECT NAME: DATA STRUCTURE

STUDENT NAME: KARINA KAUR(66)


AMRUTHA GOJE(67)
SANIKA DESHMUKH(68)
SHRUTIKA GULHANE(69)
AISHWARYA TODKARI(70)
SEMESTER: IV

SUBMITTED TO: PROF.S.V.RAUT


BREADTH FIRST SEARCH

Report
Title: Breadth First search
Executive Summary
Breadth-First Search (BFS) is a fundamental algorithm used in graph traversal
and search techniques. It systematically explores all the nodes of a graph layer by
layer, ensuring that all neighbors of a node are visited before moving on to the
next level. BFS is widely used in computer science applications, including
shortest path finding, network routing, and artificial intelligence.

Introduction
Graph traversal is a crucial aspect of computer science, allowing efficient
navigation of connected data structures. Breadth-First Search (BFS) is a strategy
that explores nodes in increasing order of their distance from the starting node.
This approach guarantees that the shortest path (in an unweighted graph) is found
efficiently. This report discusses the working mechanism of BFS, its
implementation, applications, and advantages over other traversal techniques.

What is Breadth-First Search (BFS)?


BFS is a graph traversal algorithm that explores all nodes at the present depth
level before proceeding to nodes at the next depth level. It utilizes a queue to
keep track of nodes to be explored, ensuring a systematic traversal approach
There are many ways to traverse graphs. BFS is the most commonly used
approach. BFS is a traversing algorithm where you should start traversing from a
selected node (source or starting node) and traverse the graph layerwise thus
exploring the neighbour nodes (nodes which are directly connected to source
node). You must then move towards the next-level neighbour nodes.As the name
BFS suggests, you are required to traverse the graph breadthwise as follows:
1. First move horizontally and visit all the nodes of the current layer
2. Move to the next layer

How BFS Works?


BFS operates through the following steps:

1. Initialization: Begin at a chosen starting node and mark it as visited.


2. Queue Operations: Enqueue the starting node..
3. Exploration:
o Dequeue a node from the front of the queue.
o Process the node.
o Enqueue all its unvisited adjacent nodes

4. Repetition: Repeat the process until all reachable nodes have been visited.
● Example of BFS
Consider the following graph representation:
A
/\
B C
/\ \
D E F

● Starting BFS from node A:


● Queue: [A] → Dequeue A, Visit A → Enqueue [B, C]
● Queue: [B, C] → Dequeue B, Visit B → Enqueue [D, E]
● Queue: [C, D, E] → Dequeue C, Visit C → Enqueue [F]
● Queue: [D, E, F] → Dequeue D, Visit D (No new nodes)
● Queue: [E, F] → Dequeue E, Visit E (No new nodes)
● Queue: [F] → Dequeue F, Visit F (No new nodes)
● Queue: [] (Empty, traversal complete)
Final BFS Order: A → B → C → D → E → F

Diagram Representation
Step 1: A
Step 2: A → B, C
Step 3: A → B, C → D, E, F
Step 4: A → B, C → D, E, F (Traversal complete)

Applications of BFS
- Shortest Path Finding: Used in applications like GPS navigation systems.
-Network Routing: Ensures optimal packet delivery in network
communications.
- Artificial Intelligence: Helps in solving puzzles like the 8-puzzle or Rubik’s
cube.
- Web Crawlers: Search engines use BFS for indexing web pages efficiently.

Challenges and Future Outlook


Despite its advantages, BFS suffers from high memory consumption, especially
in large graphs. Advanced optimizations, such as bidirectional BFS and heuristic-
based enhancements, aim to improve its efficiency in complex real-world
applications. Future advancements may integrate BFS with machine learning for
intelligent graph analysis.

Conclusion
Breadth-First Search is a cornerstone of graph traversal methodologies, offering
systematic exploration and shortest-path guarantees. While it has some
limitations, BFS remains indispensable in numerous domains, from networking
to artificial intelligence. A solid understanding of BFS provides a foundation for
solving various computational problems efficiently.

Recommendations
● BFS is best used when finding the shortest path in an unweighted graph.
● It is preferable when memory is not a constraint, as it requires additional
space for queue storage.
● BFS is an ideal choice for level-order traversal in tree structures.
Appendix
● Complexity Analysis:
o Time Complexity: O(V + E), where V is the number of vertices and E is the
number of edges.
o Space Complexity: O(V) due to additional memory required for queue storage.

● Alternative Traversal Methods:


o Depth-First Search (DFS)
o Dijkstra’s Algorithm (for weighted graphs)
o A* Search Algorithm
Note: This report provides a general overview of real-time applications of digital
signatures. Specific use cases and requirements may vary depending on the
industry and regulatory environment.

You might also like