Returns the strongly connected components of a graph

Property definitions

graph $ TarjanAlgorithm :: strongly_connected_components
	# Returns the strongly connected components of a graph
	fun strongly_connected_components: DisjointSet[V]
	do
		for u in graph.vertices_iterator do sccs.add(u)
		for v in graph.vertices_iterator do
			visit(v)
		end
		return sccs
	end
lib/graph/digraph.nit:633,2--641,4