| Item | Net | Tax | Gross |
|---|
Type a weighted graph as an edge list and get the single-source shortest distance to every vertex, the exact path taken to each one, and which vertices are out of reach.
Sort a graph's edges by weight and take each one that does not close a cycle, with union-find deciding. Reports the total weight and how many components survive.
Order tasks so every dependency comes first, using Kahn's algorithm, and detect a cycle by the tasks that can never become ready.
Decimal to Roman and back, validated strictly: a numeral is only accepted when re-encoding its value reproduces the input exactly, with a count of the symbols used.
Paste an SVG and strip comments, metadata, editor attributes and unused defs to see the exact number of bytes saved.
Type a size and a label, then download a real PNG, a real SVG or a copyable data URI.
Infer a draft-07 schema from an example value, edit it, then validate a document and read every error path.
A real SM-2 deck: grade each card Again, Hard, Good or Easy and get true intervals, real due dates and a 21-day forecast.
