title: How to assign "levels" to vertices of an acyclic directed graph?
body: <p>I have an acyclic directed graph.  I would like to assign levels to each vertex in a manner that guarantees that if the edge (v1,v2) is in the graph, then level(v1) > level(v2).  I would also like it if level(v1) = level(v3) whenever (v1,v2) and (v3,v2) are in the graph.  Also, the possible levels are discrete (might as well take them to be the natural numbers).  The ideal case would be that level(v1) = level(v2) + 1 whenever (v1,v2) is in the graph and there is no other path from v1 to v2, but sometimes that isn't possible with the other constraints - e.g, consider a graph on five vertices with the edges (a,b) (b,d) (d,e) (a,c) (c,e).<br>
  Does anyone know a decent algorithm to solve this?  My graphs are fairly small (|V| &lt;= 25 or so), so I don't need something blazing fast - simplicity is more important.  </p>
  
  <p>My thinking so far is to just find a least element, assign it level 0, find all parents, assign them level 1, and resolve contradictions by adding +0.5 to the appropriate vertices, but this seems pretty awful.</p>
  
  <p>Also, I get the feeling that it might be helpful to remove all "implicit" edges (i.e, remove (v1,v3) if the graph contains both (v1,v2) and (v2,v3).  </p>