| class DIGRAPH_REV_DIGRAPH_VIEW{NTP} < $DIGRAPH{NTP} |
|---|
| **** | Simplification of DIGRAPH_REV_DIGRAPH_VIEW |
| $DIGRAPH{_} | $RO_DIGRAPH{_} | $GRAPH{_,_} | $STR | $ELT{_} | $ELT | DIGRAPH_REV_DIGRAPH_VIEW{_,_} | DIGRAPH_INCL{_} | RO_DIGRAPH_INCL{_} |
| add_node(n: NTP): NTP .. Included as add_node |
|---|
| add_node: NTP .. Included as add_node |
|---|
| connect(e: DIEDGE{NTP}) .. Included as connect |
|---|
| connect(f,s: NTP) .. Included as connect |
|---|
| connect(f,s: NTP): SAME .. Included as connect |
|---|
| copy: $DIGRAPH{NTP} .. Included as copy |
|---|
| create(m:GTP): SAME .. Included as create |
|---|
| **** | Create a subgraph of "m" |
| delete_node(n: NTP) .. Included as delete_node |
|---|
| disconnect(e: DIEDGE{NTP}) .. Included as disconnect |
|---|
| disconnect(f,s: NTP) .. Included as disconnect |
|---|
| equals(g: $RO_DIGRAPH{NTP}):BOOL .. Included as equals |
|---|
| **** | True if both have the same set of nodes and edges |
| has(n: NTP): BOOL .. Included as has |
|---|
| has_edge(e: DIEDGE{NTP}): BOOL .. Included as has_edge |
|---|
| has_node(n: NTP): BOOL .. Included as has_node |
|---|
| is_empty: BOOL .. Included as is_empty |
|---|
| n_adjacent(n:NTP): INT .. Included as n_adjacent |
|---|
| n_edges: INT .. Included as n_edges |
|---|
| n_incoming(n: NTP): INT .. Included as n_incoming |
|---|
| n_nodes: INT .. Included as n_nodes |
|---|
| n_outgoing(n: NTP): INT .. Included as n_outgoing |
|---|
| size: INT .. Included as size |
|---|
| str: STR .. Included as str |
|---|
| **** | Print out the graph using the bound routine "f" for the nodes |
| adjacent!(once n: NTP): NTP .. Included as adjacent! |
|---|
| **** | Adjacent is aliased to "outgoing" |
| edge!: DIEDGE{NTP} .. Included as edge! |
|---|
| elt!: NTP .. Included as elt! |
|---|
| **** | Returns the nodes of the graph |
| incoming!(once n: NTP): NTP .. Included as incoming! |
|---|
| node!: NTP .. Included as node! |
|---|
| outgoing!(once n: NTP): NTP .. Included as outgoing! |
|---|
| node_str(n: NTP): STR .. Included as node_str |
|---|
| **** | There should not be void nodes in the graph! |
| attr source:GTP; .. Included as source |
|---|
| attr source:GTP; .. Included as source |
|---|