R - cut() - Bin Continuous Data
The cut() function divides a numeric vector into intervals and returns a factor representing which interval each value falls into. The basic syntax requires two arguments: the data vector and the…
Cut
Minimum Cut: Stoer-Wagner Algorithm
A minimum cut in a graph partitions vertices into two non-empty sets such that the total weight of edges crossing the partition is minimized. This fundamental problem appears everywhere in practice:…
Read more →Linux Text Processing with cut, sort, uniq, and wc
Linux text processing commands are the Swiss Army knife of data analysis. While modern tools like jq and Python scripts have their place, the classic utilities—cut, sort, uniq, and…
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 →