---

SGraphBitSubgraph Member List

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

• add_all_edges() [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) [virtual]
• SGraph::add_edge(const SGraphEdge &edge, bool do_forward) [virtual]
• add_node(SGraphNode node) [virtual]
• add_nodes_from_bits(const BitVector *bits) [virtual]
• add_nodes_from_list(SGraphNodeList *list) [virtual]
• add_nodes_from_sgraph(const SGraph *SGraph) [virtual]
• add_nodes_in_sgraph(const SGraph *SGraph)
• create_node() [virtual]
• get_edge_iterator() const [virtual]
• get_node_iterator() const [virtual]
• get_node_predecessor_iterator(SGraphNode node) const [virtual]
• SGraph::get_node_predecessor_iterator(SGraphNode node, bool do_forward) const [virtual]
• get_node_successor_iterator(SGraphNode node) const [virtual]
• SGraph::get_node_successor_iterator(SGraphNode node, bool do_forward) const [virtual]
• has_parent(SGraphNode node)
• is_edge_member(const SGraphEdge &edge) const [virtual]
• SGraph::is_edge_member(const SGraphEdge &edge, bool do_forward) const [virtual]
• is_node_member(SGraphNode node) const [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 [virtual]
• new_node_list() const [virtual]
• new_node_set() const [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_node(ion *out, SGraphNode node) const [virtual]
• remove_edge(const SGraphEdge &edge) [virtual]
• SGraph::remove_edge(const SGraphEdge &edge, bool do_forward) [virtual]
• remove_node(SGraphNode node) [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]
• SGraphBitSubgraph(const SGraph *parent)
• ~SGraph() [virtual]

---