Confirm that a directed path is both an arborescence and an anti-arborescence.
>
|
|
>
|
|
| (1) |
Confirm that a directed cycle is neither an arborescence nor an anti-arborescence.
>
|
|
| (4) |
Check whether a graph is an arborescence and display its root vertex.
>
|
|
| (7) |
>
|
|
Check whether a graph is an anti-arborescence and display its root vertex.
>
|
|
| (11) |
>
|
|