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
- On Karpathy's "Software is changing (again)"
- How many hours does it take to be pissed at France?
- "I'm really concerned about Hawai indigenous people's rights"
- Don't hurt pomegranates
- What love tells me
- The digital supermarket of human solitude (dating apps)
- 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