A gentle tutorial and a structured reformulation of Bock's algorithm for minimum directed spanning trees

ArXi:2603.27530v1 Announce Type: new This paper presents a gentle tutorial and a structured reformulation of Bock's 1971 Algol procedure for constructing minimum directed spanning trees. Our aim is to make the original algorithm readable and reproducible for modern readers, while highlighting its relevance as an exact decoder for nonprojective graph based dependency parsing.