Depth First Search and Breadth First Search
I am right in front of a ton of exams and I need to learn about
algorithms and data structures. When I read about pseudocode of Graph
traversal algorithms, I thought:
Why not actually implement them in a real programming language? So I did so and now you can study my code now here. I guess this problem was solved a thousand times before, but I learnt something and I hope my approach has some uniqueness to it.
Additionlay, you can also generate a topological order after you traversed the whole Graph, which is a nice little extra.
If you want the most recent version of the code, you can visit its own Github repo here.
Well, here's the code. Just download and run it like this:
# -*- coding: utf-8 -*- __author__ = 'Nikolai Tschacher' __version__ = '0.1' __contact__ = 'email@example.com' import time from collections import deque """ This is just a little representation of two basic graph traversal methods. - Depth-First-Search - Breadth-First-Search It's by no means meant to be fast or performant. Rather it is for educational purposes and to understand it better for myself. """ class Node(object): """Represents a node.""" def …