class DIGRAPH_NODE_SET_VIEW{NTP,GTP<$RO_DIGRAPH{NTP}} < $RO_SET{NTP} |
---|
**** | A view of the nodes of a digraph as a set. This is useful for looking at set properties of the nodes in the graph, for instance, finding the union or intersection of the nodes in two graphs Please see the notes in the module file |
$RO_SET{_} | $STR | $CONTAINER{_} | $ELT{_} |
$ELT | RO_SET_INCL{_} | COMPARE{_} |
DIGRAPH_NODE_SET_VIEW{_} |
copy: SAME |
---|
**** | Return a copy of the nodes in this set |
create(g: GTP): SAME |
---|
**** | Create a new view of the nodes of "g" |
has(n: NTP): BOOL |
---|
**** | Return true if the original graph has the node "n" |
size: INT |
---|
**** | Return the number of nodes in the orignal graph |
elt!: NTP |
---|
**** | Return the nodes of the original graph |
attr graph: GTP; |
---|
attr graph: GTP; |
---|