| DigraphGeneratorRootedOutDAG Method |
Returns a random rooted-out DAG on V vertices and E edges.
A rooted out-tree is a DAG in which every vertex is reachable from a
single vertex.
The DAG returned is not chosen uniformly at random among all such DAGs.
Namespace: Algs4Net
Assembly: Algs4Net (in Algs4Net.dll) Version: 1.0.0.0 (1.0.0.0)
SyntaxC#
public static Digraph RootedOutDAG( int V, int E )
Parameters
- V
- Type: SystemInt32
the number of vertices - E
- Type: SystemInt32
the number of edges
Return Value
Type: Digrapha random rooted-out DAG on V vertices and E edges
See Also