(ah ( (dh (eb ( ( ( (hf (ifigure example of run of algorithm topological sort (code fragment the label near vertex shows its current incount valueand its eventual rank in the resulting topological order the highlighted vertex is one with incount equal to zero that will become the next vertex in the topological order dashed lines denote edges that have already been examined and which are no longer reflected in the incount values