The Digraph class represents an directed graph of vertices named 0 through V-1. It supports the following operations: add an edge to the graph, iterate over all of the neighbors incident to a vertex. Parallel edges and self-loops are permitted. For additional documentation, see <
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected