abstract class $RO_UGRAPH{NTP} < $GRAPH{NTP,UEDGE{NTP}} |
---|
**** | Undirected graphs. NTP indicates the type of the node index which is used internally by a graph implementation to access its
_ Since there is no valid subtyping relationship between ugraphs and digraphs (neither is a proper subtype of the other) and due to the subtle relationships between them, there is no subtyping relationship between directed and undirected graphs. We (will) provide explicit conversion methods and adaptor "views" to see a digraph as an undirected graph and vice versa |
$GRAPH{_,_} | $STR | $ELT{_} | $ELT |
$UGRAPH{_} | UGRAPH{_} | UGRAPH_INCL{_} |
copy: $RO_UGRAPH{NTP}; |
---|
**** | Return a copy of the graph |
equals(g: $RO_UGRAPH{NTP}): BOOL; |
---|
**** | Return true if self = "g" i.e. if all the nodes and edges are equal (by is_eq) |