Graph Theory

Scalable Graph Partitioning for Distributed Graph Processing

by

I just realized that the link to my doctoral thesis doesn’t work, so I decided to host it on the Finxter blog as a backup. Find the thesis here: 🔗 PDF Download link: https://blog.finxter.com/wp-content/uploads/2023/09/dissertation_christian_mayer_distributed_graph_processing_DIS-2019-03.pdf Here’s the abstract: 💡 Abstract: Distributed graph processing systems such as Pregel, PowerGraph, or GraphX have gained popularity due to their … Read more

New Research Suggests That Chatbots Form Homophil Social Networks Like Humans

by

Recent research found that AI chatbots can form societies mimicking human social dynamics. The study carried out on Chirper.ai, a platform populated only by chatbots, revealed that similar AI agents engage more than dissimilar ones, much like humans do. These findings open the door to developing more sophisticated AI-driven models of human societies, revolutionizing our … Read more

Graphviz Executables Not Found Error (Fixed)

by

Are you having trouble running Graphviz executables? Are you encountering an error message that says “Graphviz’s executables not found”? This is a common issue that can occur when working with Graphviz, a popular open-source graph visualization software. Graphviz is a powerful tool used for creating diagrams, flowcharts, and other visual representations of data. However, it … Read more

Python Beam Search Algorithm

by

You 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

Python Backtracking – A Helpful Guide with Video

by

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

Jump Search Algorithm in Python – A Helpful Guide with Video

by

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

How to Visualize Data in Python — Graphviz, ImageDraw, and Turtle

by

“Numbers have an important story to tell. They rely on you to give them a clear and convincing voice.” ― Stephen Few “Visualizations act as a campfire around which we gather to tell stories.” ― Al Shalloway “The goal is to turn data into information and information into insight.” ― Carly Fiorina These quotes are … Read more

Python A* – The Simple Guide to the A-Star Search Algorithm

by

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

Python Dijkstra Algorithm

by

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

The Best-First Search Algorithm in Python

by

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

Iterative Deepening Depth-First Search (DFS) Algorithm in Python

by

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

Python Depth-First Search (DFS) Algorithm

by

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