class HIERARCHIC_GRAPH_NODE [E -> HASHABLE]
Summary
Overview
creation features
exported features
  • is_equal (other: HIERARCHIC_GRAPH_NODE [E -> HASHABLE]): BOOLEAN
    Is other attached to an object considered equal to current object?
make (i: E)
effective procedure
item: E
writable attribute
max_rank: INTEGER_32
writable attribute
min_rank: INTEGER_32
writable attribute
parents: FAST_ARRAY[HIERARCHIC_GRAPH_NODE [E -> HASHABLE]]
writable attribute
children: FAST_ARRAY[HIERARCHIC_GRAPH_NODE [E -> HASHABLE]]
writable attribute
set_item (i: E)
effective procedure
parents_count: INTEGER_32
effective function
children_count: INTEGER_32
effective function
add_parent (node: HIERARCHIC_GRAPH_NODE [E -> HASHABLE])
effective procedure
add_child (node: HIERARCHIC_GRAPH_NODE [E -> HASHABLE])
effective procedure
remove_parent (node: HIERARCHIC_GRAPH_NODE [E -> HASHABLE])
effective procedure
has_parent_edge (id: INTEGER_32): BOOLEAN
effective function
has_child_edge (id: INTEGER_32): BOOLEAN
effective function
remove_child (node: HIERARCHIC_GRAPH_NODE [E -> HASHABLE])
effective procedure
remove_parent_edge (id: INTEGER_32): HIERARCHIC_GRAPH_NODE [E -> HASHABLE]
effective function
Return connected node.
restore_parent_edge (id: INTEGER_32, node: HIERARCHIC_GRAPH_NODE [E -> HASHABLE])
effective procedure
remove_child_edge (id: INTEGER_32): HIERARCHIC_GRAPH_NODE [E -> HASHABLE]
effective function
Return connected node.
restore_child_edge (id: INTEGER_32, node: HIERARCHIC_GRAPH_NODE [E -> HASHABLE])
effective procedure
deep_reset_edges
effective procedure
Set edge identifiers with values starting from 0.
parent (i: INTEGER_32): HIERARCHIC_GRAPH_NODE [E -> HASHABLE]
effective function
child (i: INTEGER_32): HIERARCHIC_GRAPH_NODE [E -> HASHABLE]
effective function
has_parent (other: HIERARCHIC_GRAPH_NODE [E -> HASHABLE]): BOOLEAN
effective function
has_child (other: HIERARCHIC_GRAPH_NODE [E -> HASHABLE]): BOOLEAN
effective function
parent_edge (i: INTEGER_32): INTEGER_32
effective function
child_edge (i: INTEGER_32): INTEGER_32
effective function
has_cycle: BOOLEAN
effective function
has_parent_cycle: BOOLEAN
effective function
has_children_cycle: BOOLEAN
effective function
is_toplevel: BOOLEAN
effective function
is_leaf: BOOLEAN
effective function
is_connected_to (other: HIERARCHIC_GRAPH_NODE [E -> HASHABLE]): BOOLEAN
effective function
distance (other: HIERARCHIC_GRAPH_NODE [E -> HASHABLE]): INTEGER_32
effective function
set_rank
effective procedure
add_connected_nodes_in (list: COLLECTION[HIERARCHIC_GRAPH_NODE[E]])
effective procedure
Add in list all nodes belonging to the same graph as Current
fill_path_to (path: COLLECTION[INTEGER_32], destination: HIERARCHIC_GRAPH_NODE [E -> HASHABLE])
effective procedure
Add in path edges identifiers corresponding to a path from current node to destination node.
hash_code: INTEGER_32
effective function
The hash-code value of Current.
is_equal (other: HIERARCHIC_GRAPH_NODE [E -> HASHABLE]): BOOLEAN
deferred function
Is other attached to an object considered equal to current object?