int function ( VertexType arg0 ) { return finishTimeList [ arg0 . getLabel ( ) ] ; }
return the timestamp indicating when the given vertex was finished meaning that all of its descendents were visited recursively . concode_field_sep VertexChooser<VertexType> vertexChooser concode_elem_sep boolean DEBUG concode_elem_sep int BLACK concode_elem_sep GraphType graph concode_elem_sep int[] colorList concode_elem_sep int[] finishTimeList concode_elem_sep SearchTreeCallback<VertexType> searchTreeCallback concode_elem_sep LinkedList<VertexType> topologicalSortList concode_elem_sep int[] discoveryTimeList concode_elem_sep int WHITE concode_elem_sep int[] dfsEdgeTypeList concode_elem_sep int GRAY concode_elem_sep int timestamp concode_field_sep void classifyUnknownEdges concode_elem_sep void visitAll concode_elem_sep void setFinishTime concode_elem_sep int getColor concode_elem_sep void setSearchTreeCallback concode_elem_sep Iterator<EdgeType> outgoingEdgeIterator concode_elem_sep Iterator<VertexType> topologicalSortIterator concode_elem_sep int[] getFinishTimeList concode_elem_sep boolean visitMe concode_elem_sep void setDiscoveryTime concode_elem_sep VertexType getTarget concode_elem_sep AbstractDepthFirstSearch<GraphType,EdgeType,VertexType> search concode_elem_sep void setVertexChooser concode_elem_sep void setColor concode_elem_sep int getDiscoveryTime concode_elem_sep VertexType getSource concode_elem_sep void setDFSEdgeType concode_elem_sep int getDFSEdgeType concode_elem_sep Collection<VertexType> unvisitedVertices concode_elem_sep VertexType getNextSearchTreeRoot concode_elem_sep boolean containsCycle