Blog

First, a bit of dry theory about pathfinding.

One of the shortest-path algorithms is the Dijkstra algorithm. It is used to find the shortest path in a graph from a starting point to all other points, or the shortest path to one specific destination.

This is how it works on a graph:

• the dista...

The Problem It Solves

At 3:00 AM on Monday, one of the shutters goes unavailable for two minutes, then recovers on its own. By the time you check in the morning, ETS Group Monitor was not running, the log produced by the expensive KNX target hardware has already rotated away, and you have no ide...