top of page

PATHFINDING PROJECT:

GRAPH SEARCH ALGORITHMS

Breadth First Search

Depth First Search

Language:  Python

Date:  Spring 2015

Class:  Data Structures

 

I implemented search algorithms, Breadth-First Search (BFS) and Depth-First Search (DFS) in a base Graph class of the user-interface program.  The goal of these algorithms is to find a path from randomly chosen vertex (indicated by the green square) to another randomly chosen vertex (the red square).  The algorithms use Stack and Queue classes that I had also made, inheriting from a Linked List class. 

bottom of page