yet another source of inspiration…
A Personal Moment of Disruption Last week, I downloaded Google’s new development environment: Antigravity. After decades in software engineering, I’ve learned to be skeptical. I’ve seen countless hypes come and go — new languages, new frameworks, new paradigms, new tools. Some changed the industry, many quietly disappeared. So after reading Antigravity’s glossy marketing material, my… Read more Antigravity and the End of Gravity in Software Engineering?
It all started on a rainy afternoon when my kids asked a very dangerous question:“Dad… can’t we turn our own pictures into pixel art?” That question triggered what every developer-parent knows too well — a new side project was inevitable. A Small App with a Big Creative Goal So I built a small pixel image… Read more A Geek’s Love Letter to Pixels
For years, my Android unlock pattern was my fortress — a carefully chosen sequence of swipes that I thought only I could remember. Unfortunately, I underestimated two things: (1) the persistence of children, and (2) their uncanny ability to casually “observe” without being noticed. One day, I realized my long-guarded pattern had been compromised. My… Read more Mobilephone Unlock-Pattern Generator
When developing software prototypes to optimize linear problems, it is sometimes desirable to provide the customer with an app to avoid the need for them to install a full python environment with all dependencies. In python, there is a tool called PyInstaller for this purpose. However, there are a few hurdles that need to be… Read more Generate EXEs solving MILPs using PyInstaller in Python
This is a similar post as the one on Graph Coloring. However, this in this post I show an application of the graph coloring problem, allowing us to answer practical questions using graph theory. In this post we’ll first tackle a map coloring problem manually, then we’ll use a MiniZinc constraint programming script to validate the solution found.
A node coloring is valid or admissible if any two adjacent nodes do not have the same color. If a graph is colorable, there is a smallest number such that the graph is node colorable. This number is called the chromatic number of the graph and is usually denoted by . The problem to identify… Read more Graph Coloring Problem
In this post I’d like to introduce you to a cool webbased tool to visualize directed or undirected graphs. It is hosted at csacademy.com and can be found here. The following image shows a potential solution to the TSP problem with 5 locations, when the subtour elimination constraint is not considered. In order to generate… Read more Graph Modelling Tool
This post is for people, who once in a while have to deal with git and therefore don’t repeat the commands frequently enough in order to keep them in longtime memory. 😛 I’ll provide a simple short reference containing the commands needed most frequently and enrich the reference when necessary. Clone an existing Repository from… Read more Minimal Git Knwo-How