abstract class $RO_DIGRAPH{NTP} < $GRAPH{NTP,DIEDGE{NTP}} |
---|
**** | NTP is the type of the node i.e. the type of the unique node index. This is a read-only digraph abstraction. No modifying operations are permitted. Most views of digraphs are of this type |
$GRAPH{_,_} | $STR | $ELT{_} | $ELT |
copy: $RO_DIGRAPH{NTP}; |
---|
**** | Create a copy of this digraph. The copy is also read-only |
equals(g: $RO_DIGRAPH{NTP}): BOOL; |
---|
**** | Return true if the self and "g" have the same structure and the same nodes. The nodes must be the *same* (i.e. =), and in both graphs the must be the same edges between nodes |
incoming!(once n: NTP): NTP; |
---|
**** | Yield the incoming edges into the node "n". No ordering is guaranteed |
n_incoming(n: NTP): INT; |
---|
**** | Return the number of incoming edges into the node "n" |
n_outgoing(n: NTP): INT; |
---|
**** | Return the number of outgoing edges from the node "n" |
outgoing!(once n: NTP): NTP; |
---|
**** | Yield the outgoing edges from the node "n" |