I've been doing a lot with graphs over the past couple of years. Basically since I started using neo4j, although not everything involves neo4j directly. I've developed a number of really interesting graph algorithms, but I'm always a bit disappointed by how little use I get out of my graph theory knowledge. I've never needed a Hamilton path or do something with the degrees of my vertices. It's all just logic and intuition.
But maybe I should read this to see if there's anything that applies to my current work.
Graphs are fantastic - PageRank [1] that powered Google Search (still does to some extent), TextRank for extractive text summarisation [2], Louvain for neighbourhood detection [3] all use graphs, as well as tonnes of others like belief propagation, Markov clustering, A*, and so on. So yeah, learn it.
Cool. I am applying to jobs and it seems graph theory is popular in the "Leet Code" questions pace. So very timely, thank you! And clever domain name :)
not super fond of my memories of having to come up with a graph demonstration on a fixed time on a paper exam, but at least I can say I was once a person that could do that!
Sure I can. But from my experience solutions in math books usually continue learning process and can provide even more insight to a problem. Solutions from ChatGPT or Claude barely can replace that.
Everything, except the bleeding edge and situations requiring the context window to be more than 60% filled, are elementary to Opus 5.5 . If you provide the questions completely, you can be very sure that Claude’s solutions will be correct. The world has changed; AI is reliable; we need to adapt.
We have experienced that adverserial review cycles is the only way to really guarantee good outputs from coding agents - best modelled as a cyclic graph.
I don't think modelling this as a graph adds anything that you wouldn't get from the phrase 'adversarial review cycles' already. So graph theory is pretty much useless for this application.
But maybe I should read this to see if there's anything that applies to my current work.
[1] https://en.wikipedia.org/wiki/PageRank
[2] https://aclanthology.org/W04-3252.pdf
[3] https://en.wikipedia.org/wiki/Louvain_method
There are plenty of ways to get a copy.
Please prove me wrong.