question: LinkedList < N > computeOrder ( DirectedGraph < N > g ) { stmtToColor = new HashMap < N , Integer > ( ) ; order = new LinkedList < N > ( ) ; graph = g ; PseudoTopologicalReverseOrderer < N > orderer = new PseudoTopologicalReverseOrderer < N > ( ) ; reverseOrder = orderer . newList ( g ) ; { Iterator < N > stmtIt = g . iterator ( ) ; while ( stmtIt . hasNext ( ) ) { N s = stmtIt . next ( ) ; stmtToColor . put ( s , WHITE ) ; } } { Iterator < N > stmtIt = g . iterator ( ) ; while ( stmtIt . hasNext ( ) ) { N s = stmtIt . next ( ) ; if ( stmtToColor . get ( s ) == WHITE ) { visitNode ( s ) ; } } } return order ; }
target:  Orders in pseudo-topological order.