Go Race Detector: Finding Data Races
A data race happens when two or more goroutines access the same memory location concurrently, and at least one of those accesses is a write. The result is undefined behavior—your program might crash,…
Read more →Finding
Bridges in Graph: Finding Cut Edges
A bridge (or cut edge) in an undirected graph is an edge whose removal increases the number of connected components. Put simply, if you delete a bridge, you split the graph into two or more…
Read more →Articulation Points: Finding Cut Vertices in Graphs
An articulation point (also called a cut vertex) is a vertex in an undirected graph whose removal—along with its incident edges—disconnects the graph or increases the number of connected components….
Read more →