CGL::AbstractDiGraph(V)

Returns the number of strongly connected components in self.

Returns the number of weakly connected components in self.

Returns the degree of the given vertex v.

For directed graphs, the value equals #out_degree_of.

For undirected graphs, the value is the sum of #in_degree_of and #in_degree_of.

Returns the density of self.

Self loops are counted in the total number of edges so graphs with self loops can have density higher than 1.

Whether self is directed.

Yields each edges in the graph.

Yields each edge incident to u in the graph.

Yields each strongly connected component of self as an `Array'.

Note: Based on (Tarjan, 1972) and (Nuutila and Soisalon-Soinen, 1994)

Returns an iterator of strongly connected components.

Yields each successor of u in the graph.

Yields each connected component of self as an `Array'.

Returns an Iterator of connected components.

Whether self is strongly connected.

Whether self is weakly connected.