Matija HorvatYou can check out the slide deck here to get a first intuition on how the algorithm works: Before we’ll dive into the algorithm and the Python implementation, let’s first skim over some related graph tutorials you may enjoy and that may help your understanding! Related Graph Tutorials This algorithm is part of our graph … Read more
You can check out the slides here (direct PDF link): Before we’ll dive into the algorithm and the Python implementation, let’s first skim over some related graph tutorials you may enjoy and that may help your understanding! Related Graph Tutorials This algorithm is part of our graph algorithm tutorials: Breadth-First Search (BFS) Algorithm in Python … Read more
As you watch the video, you can have a look at the slides as PDF: download slides in a new tab here. Before we’ll dive into the algorithm and the Python implementation, let’s first skim over some related graph tutorials you may enjoy and that may help your understanding! Related Graph Tutorials This algorithm is … Read more
This tutorial guides you into the fascinating A* (A-Star) using the Python programming language. First, feel free to watch the video guide—we’ll give a detailed textual explanation below. The slides can be found as a Gif here: Okay, so let’s dive into the algorithm motivation, explanation, and Python code next! What is the A* Search … Read more
You can download the PDF file of the presentation here. Also, watch the presentation as a Gif here: What is Dijkstra’s Algorithm? Dijkstra’s algorithm solves the single-source shortest path (SSSP) problem. Generally, it enables finding the shortest route between two vertices in a graph. Its author is dr. Edsger W. Dijkstra, a pioneering contributor to … Read more
You can watch the slides as a GIF here: And download the slides as PDF here. What’s the Best-First Search Algorithm? After several articles on uninformed search algorithms, we continue our journey to informed search algorithms. The first one in the series is the Best-First search algorithm. In general, informed search algorithms use some kind … Read more
What is an Iterative Deepening Depth-First Search Algorithm? Continuing our story even further, after introducing graphs and basic graph traversal algorithms, we will refine the Depth-First Search Algorithm by introducing the iterative depth limitation. An iterative deepening depth-search algorithm also traverses a graph by exploring it vertex-by-vertex, but it does it by following the vertical … Read more
What is a Depth-First Search (DFS) Algorithm? Building on our previous story about graphs and graph traversal algorithms, this time we will look into a depth-first search algorithm. A depth-search algorithm also traverses a graph by exploring it vertex-by-vertex, but it does it by following the vertical order of the vertices. Although the depth-first search … Read more
What is a Graph? When we want to illustrate how one thing relates to another, most often, we would preferably use a graph. From a concrete perspective, a graph is a graphical representation or an image of relationships. A graph is built of entities and their relationships. Entities represent actors in a relationship you are … Read more
What is the Quickselect algorithm? The Quickselect algorithm is a computer algorithm designed to find the kth (e.g. smallest or largest) element from an unordered list. It is based on the idea behind the Quicksort algorithm, invented by the same author, Sir Charles Anthony Richard (Tony) Hoare. Here, k stands for the index of an … Read more
A simple swap function in Python is generally considered a function that takes two initialized variables, a = val_a and b = val_b, and returns a result of a = val_b and b = val_a. The function accepts variables of arbitrary types, or more precisely, variables that are assigned with objects of arbitrary types. Although … Read more