Bellman–Ford, explained clearly.
A practical guide to shortest paths, negative edges, negative cycles, and a Python implementation.
Data science · Computer science education
Current direction
My work has been in data science. I am now training to teach computer science, with an interest in clear explanations, practical examples, and the thinking behind the tools.
Short articles and opinions published here, plus current study. Browse the full article list, or subscribe via RSS . This is not a publication record or portfolio of formal work.
A practical guide to shortest paths, negative edges, negative cycles, and a Python implementation.
A practical guide to base cases, recursive steps, and reading recursive programs without getting lost in the stack.
Why a correct-looking AI response is weak evidence that a learner understands the subject — and what to check instead.
A practical classroom habit for turning program failures into evidence — reproduce, narrow, hypothesise, and test.
Current teacher training at London Metropolitan University.
Course detailsStart a conversation
For education or computing-related conversations, connect with me on LinkedIn.