Later, Tarjan (1977) proposed an improved version of this algorithm for dense graphs, whose complexity is O(n 2 ), the same as for undirected graphs using Prim's algorithm.
a second advantage of using non-projective dependency trees is the fact that it leads to more efficient parsers.