Algorithm Search⌘K

Problemadvanced

st-numbering

Also called st-ordering, bipolar orientation.

Ordering of the vertices of a biconnected graph with s first and t last, such that each other vertex has neighbours on both sides.

Ordering of the vertices of a biconnected graph with s first and t last, such that each other vertex has neighbours on both sides.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • Definition
  • one source with a locator