/explore
|
You are here 
|
matbesancon.xyz | ||
| | | | |
spin0r.wordpress.com
|
|
| | | | | Every serious competitive programmer knows how to find all bridges and articulation points in an undirected graph in linear time. Recently, however, I came across a problem that required finding the biconnected components explicitly, and I couldn't figure out how to do it. The usual suspects, surprisingly, don't explain it. Sedgewick's Algorithms, 3rded., PartV discusses... | |
| | | | |
mathspp.com
|
|
| | | | | This post goes over a well known riddle about measuring quantities. | |
| | | | |
www.jeremykun.com
|
|
| | | | | The graph is among the most common data structures in computer science, and it's unsurprising that a staggeringly large amount of time has been dedicated to developing algorithms on graphs. Indeed, many problems in areas ranging from sociology, linguistics, to chemistry and artificial intelligence can be translated into questions about graphs. It's no stretch to say that graphs are truly ubiquitous. Even more, common problems often concern the existence and optimality of paths from one vertex to another ... | |
| | | | |
codingrelic.geekhold.com
|
|
| | | I'd say not to spend it all in one place but I think the maximum number of places they could possibly spend it is four, so... go ahead. Live... | ||
