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
- How Feldenkrais made me the best math teacher
- A cybersecurity take on the Swedish postal system
- The dread of teaching pointless math ruins generations
- The differences between junior and senior software engineers
- Neural networks, Professor Trelawney, and ping pong smashers: all the issues with artificial intelligence
- We won – What does the world look like in 2030?
- How papers killed academia
- For a life in Adagio
- The proof that Go channels aid concurrency
- The best ways to organize pointless meetings