Coding - C++

Prim's algorithm solves problems such as finding the Minimum Spanning Tree (MST) of a graph. With a MST we mean the solution set that connects every node of a graph together with the least weight. let's say for example that you want to every major city

So not so long ago (10th of June) Max Howell tweeted a post stating: Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off. This post got me started for solving this particular problem because

In the last semester of school we are learning about datastructures and algorithms. Because this is a very popular subject for companies, I have decided to write articles about it. They will be numbered from easy to hard so that you are able to learn the most critical sorting algorithms

Introduction The Floyd-Warshall algorithm is an algorithm used for finding the shortest paths in a weighted graph (just as Prim's Algorithm is one). The algorithm works by starting from a graph matrix (n x m size) and then iterating for every row and column pair in this graph.

Depth-First search and Breadth-First search are search algorithms that help us traversing trees and graphs. We can use these algorithms to solve complex problems such as maze solving, maze generation, … Here I will explain how both these algorithms work and how their pseudocode works for the tree version and the

Depth-First search and Breadth-First search are search algorithms that help us traversing trees and graphs. We can use these algorithms to solve complex problems such as maze solving, maze generation, … Here I will explain how both these algorithms work and how their pseudocode works for the tree version and the