Algorithm visualizations
Random contractionDrag vertices to rearrange
SupervertexSelected for contractionEdge label = parallel edge count
- Vertices left
- Edges left
- Returned cut
- —
- Minimum cut
- Best so far
- —
Contraction result
Supervertices and edge multiplicities
A labeled edge represents that many parallel edges. Each parallel edge is equally likely to be chosen. Merged nodes list their original vertices.
| Supervertex | Original vertices |
|---|
Item
—Hash
—
Register ——
- Estimate
- 0
- Exact count
- 0
- Error
- —
- Processed
- 0
Distinct countEstimateExact
Edit the stream
Repeated lines count as the same item; blank lines are ignored.
Edits haven’t been applied yet.
Estimator details
- Raw estimate
- Empty registers
- Typical standard error
Orange = selected, dashed = neighbor sharing variables
Clauses sharing variables
Filled = true; outlined = false; gray = unassigned.
- Unsatisfied clauses
- Resamplings
- Variables redrawn
Orange = incoming item, green = retained sample
Fixed-rate boostingDrag points to move; click to flip labels
Label +1Label −1Green shading = prediction +1Blue shading = prediction −1Dashed = latest classifierRed border = ensemble error
Keyboard: focus a point, then use arrow keys to move it or Enter to flip its label.