Suppose you have a non-directed graph, represented through its adjacency matrix. How would you discover how many paths of length link any two nodes? For example, in the graph aside…
Blog entries
- Why I stepped away from my smartphone – and why I am unlikely to go back to it
- “You don’t have the experience we are looking for”
- Deform an unstructured mesh (or how a good angle dramatically simplifies a problem)
- What do mathematicians do? Inside a mathy mind (3b1b Summer of Math Exposition)
- How to implement the 6-hour workday in a company
- Setup OpenWRT on Raspberry Pi 3 B+ to avoid data trackers
- Automate spam/pending comments deletion in WordPress + bbPress
- A fix for broken (physical) buttons and dead touch area on Android phones
- FOSS Android Apps and my quest for going Google free on OnePlus 6
- A setup for remote piano lesson over Zoom