Graphs

Exploring and traversing a maze…

A while ago, I mentioned that I was taking a deep interest into the “Advent of Code” (AoC) project by Eric Wastl. Since then, I’ve filled my dedicated Github repository quite a lot: I’ve worked on this year’s challenges both in Python and Javascript (Node JS), and I’ve also started to take a look at some challenges from 2018. Recently, one of the challenge was about maze exploration and traversal and it re-acquainted me with interesting algorithmic concepts.

Read More »Exploring and traversing a maze…

A quick study of algorithmic key concepts: graphs, heaps…

As their name implies, algorithmics deal with building, studying and optimizing algorithms (by reducing execution time or used memory for example). While the field comprises several grand directions such as algorithm design, complexity theory and analysis, all of these are closely related to each other which makes it kind of hard to treat ‘the science of algorithms’ as a whole.

Read More »A quick study of algorithmic key concepts: graphs, heaps…