Introduction Depth-First Search or DFS in short, is a common graph traversal algorithm over graphs. Imagine that you are digging a hole in the ground. You could dig deep first and then widen the hole or do the opposite. Unlike…
Introduction Breadth-First Search or BFS in short, is one of the most commonly used traversal algorithms over graphs, also having many practical applications such as shortest path finding, web crawling and more. What is a graph traversal algorithm? Graph traversal…
This article is about a sorting algorithm on a directed graph’s vertices that commonly pops up in interview questions. If you need a refresher on graphs please refer to our intro to graphs article. Formal Definition Topological Sort is an…
Introduction Graphs are mathematical objects that are used in graph theory in order to model the relationships between objects. They are defined by 2 sets: Vertices – denoted as . These are the “elements” in our graph.Edges – denoted as…
Introduction Decorators in Python are a metaprogramming technique, in the sense that we are manipulating the program code itself using our code. A decorator is used in order to extend the functionality of an object, without explicitly modifying it. Before…
NOTE: Some of the code examples here assume you have a basic understanding of Runtime Complexity and Linked Lists. If you are not familiar with the subjects, we suggest you read our runtime complexity article and our linked list article.…
NOTE: This article will also discuss the runtime complexity of different operations performed on a linked list. If you need a refresher on runtime complexity, please visit our article on the subject. What are linked lists? A linked list is…
If you’re learning to program, or maybe you’re a Computer Science student, you probably heard about runtime complexity, and phrases like “it has a runtime complexity of “.Well, before we dive into understanding the subject, lets first make sure we’re…