---

NGraphSubgraph Member List

This is the complete list of members for NGraphSubgraph, including all inherited members.

• add_all_edges() [virtual]
• add_all_nnode_predecessor_edges(T *nnode) [virtual]
• add_all_nnode_predecessor_edges(T *nnode, bool do_forward) [inline, virtual]
• add_all_nnode_successor_edges(T *nnode) [virtual]
• add_all_nnode_successor_edges(T *nnode, bool do_forward) [inline, virtual]
• add_all_node_predecessor_edges(SGraphNode node) [virtual]
• add_all_node_predecessor_edges(SGraphNode node, bool do_forward) [virtual]
• add_all_node_successor_edges(SGraphNode node) [virtual]
• add_all_node_successor_edges(SGraphNode node, bool do_forward) [virtual]
• add_edge(const SGraphEdge &edge) = 0 [pure virtual]
• add_edge(const SGraphEdge &edge, bool do_forward) [virtual]
• add_nedge(T *from_nnode, T *to_nnode) [inline, virtual]
• NGraph::add_nedge(const NEdge<T>& edge) [virtual]
• NGraph::add_nedge(const NEdge<T>& edge, bool do_forward) [inline, virtual]
• add_nnode(T *nnode) [inline, virtual]
• add_node(SGraphNode node) = 0 [pure virtual]
• add_nodes_from_bits(const BitVector *bits) [virtual]
• add_nodes_from_list(SGraphNodeList *list) [virtual]
• add_nodes_from_sgraph(const SGraph *SGraph) [virtual]
• create_node() [virtual]
• get_edge_iterator() const [virtual]
• get_nnode_from_node(SGraphNode node) const [inline, virtual]
• get_nnode_iterator() const [virtual]
• get_nnode_predecessor_iterator(T *nnode) const [virtual]
• get_nnode_predecessor_iterator(T *nnode, bool do_forward) const [inline, virtual]
• get_nnode_successor_iterator(T *nnode) const [virtual]
• get_nnode_successor_iterator(T *nnode, bool do_forward) const [inline, virtual]
• get_node_from_nnode(T *nnode) const [inline, virtual]
• get_node_iterator() const [virtual]
• get_node_predecessor_iterator(SGraphNode node) const [virtual]
• NGraph::get_node_predecessor_iterator(SGraphNode node, bool do_forward) const [virtual]
• get_node_successor_iterator(SGraphNode node) const [virtual]
• NGraph::get_node_successor_iterator(SGraphNode node, bool do_forward) const [virtual]
• has_parent(SGraphNode node)
• is_edge_member(const SGraphEdge &edge) const = 0 [pure virtual]
• is_edge_member(const SGraphEdge &edge, bool do_forward) const [virtual]
• is_nedge_member(T *from_nnode, T *to_nnode) const [inline, virtual]
• NGraph::is_nedge_member(const NEdge<T>& edge) const [virtual]
• NGraph::is_nedge_member(const NEdge<T>& edge, bool do_forward) const [inline, virtual]
• is_nnode_member(const T& nnode) const [inline, virtual]
• NGraph::is_nnode_member(T *nnode) const = 0 [pure virtual]
• is_node_member(SGraphNode node) const = 0 [pure virtual]
• is_node_subset_in_bits(const BitVector *bits) [virtual]
• is_node_subset_in_list(SGraphNodeList *list) [virtual]
• is_node_subset_in_sgraph(const SGraph *SGraph) [virtual]
• max_num_nodes() const = 0 [pure virtual]
• new_node_list() const [virtual]
• new_node_set() const [virtual]
• NGraphSubgraph() [inline]
• NGraphSubgraph(const NGraphSubgraph<T> &other) [inline]
• NGraphSubgraph(NGraph<T> *parent, SGraph *sub_graph, bool owned) [inline]
• nnode_has_predecessors(T *nnode) const [virtual]
• nnode_has_predecessors(T *nnode, bool do_forward) const [inline, virtual]
• nnode_has_successors(T *nnode) const [virtual]
• nnode_has_successors(T *nnode, bool do_forward) const [inline, virtual]
• node_has_predecessors(SGraphNode node) const [virtual]
• node_has_predecessors(SGraphNode node, bool do_forward) const [virtual]
• node_has_successors(SGraphNode node) const [virtual]
• node_has_successors(SGraphNode node, bool do_forward) const [virtual]
• operator=(const SGraph &) [protected]
• print(ion *out) const [virtual]
• print_debug() const [virtual]
• print_edge(ion *out, const SGraphEdge &edge) const [virtual]
• print_edge(ion *out, const SGraphEdge &edge, bool do_forward) const [virtual]
• print_nedge(ion *out, T *from_nnode, T *to_nnode) const [inline, virtual]
• NGraph::print_nedge(ion *out, const NEdge<T>& edge) const [virtual]
• NGraph::print_nedge(ion *out, const NEdge<T>& edge, bool do_forward) const [inline, virtual]
• print_nnode(ion *out, T *nnode) const [inline, virtual]
• print_node(ion *out, SGraphNode node) const [virtual]
• remove_edge(const SGraphEdge &edge) = 0 [pure virtual]
• remove_edge(const SGraphEdge &edge, bool do_forward) [virtual]
• remove_nedge(T *from_nnode, T *to_nnode) [inline, virtual]
• NGraph::remove_nedge(const NEdge<T>& edge) [virtual]
• NGraph::remove_nedge(const NEdge<T>& edge, bool do_forward ) [inline, virtual]
• remove_nnode(T *nnode) [inline, virtual]
• remove_nnode_predecessor_edges(T *nnode) [virtual]
• remove_nnode_predecessor_edges(T *nnode, bool do_forward) [inline, virtual]
• remove_nnode_successor_edges(T *nnode) [virtual]
• remove_nnode_successor_edges(T *nnode, bool do_forward) [inline, virtual]
• remove_node(SGraphNode node) = 0 [pure virtual]
• remove_node_predecessor_edges(SGraphNode node) [virtual]
• remove_node_predecessor_edges(SGraphNode node, bool do_forward) [virtual]
• remove_node_successor_edges(SGraphNode node) [virtual]
• remove_node_successor_edges(SGraphNode node, bool do_forward) [virtual]
• remove_nodes_from_bits(const BitVector *bits) [virtual]
• remove_nodes_from_list(SGraphNodeList *list) [virtual]
• remove_nodes_from_sgraph(const SGraph *SGraph) [virtual]
• reset(NGraph<T> *parent, SGraph *sub_graph, bool owned) [inline]
• ~NGraphSubgraph() [inline]
• ~SGraph() [virtual]

---