2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/167463We present an $\tilde{O}(n^{2.5})$-time algorithm for maintaining the topological order of a directed acyclic graph with $n$ vertices while inserting $m$ edges.Better results have been proposed in the following paper: Haeupler, Kavitha, Mathew, Sen, Tarjan: Faster Algorithms for Incremental Topological Ordering. ICALP (1) 2008: 421-433Computer Science and Game TheoryData Structures and AlgorithmsF.2.2text