Main Page   Class Hierarchy   Compound List   File List   Compound Members   File Members  

SGraph Class Reference

#include <sgraph.h>

Inheritance diagram for SGraph:

NGraph SGraphBit SGraphBitSubgraph SGraphList SuperGraph NGraphBase NGraphSubgraph List of all members.

Public Methods

virtual ~SGraph ()
virtual SGraphNode max_num_nodes () const = 0
virtual bool is_node_member (SGraphNode node) const = 0
virtual void add_node (SGraphNode node) = 0
virtual void remove_node (SGraphNode node) = 0
virtual void print_node (ion *out, SGraphNode node) const
virtual bool is_edge_member (const SGraphEdge &edge) const = 0
virtual void add_edge (const SGraphEdge &edge) = 0
virtual void remove_edge (const SGraphEdge &edge) = 0
virtual void print_edge (ion *out, const SGraphEdge &edge) const
virtual void print (ion *out) const
virtual void print_debug () const
virtual SNodeIter get_node_iterator () const = 0
virtual SNodeIter get_node_successor_iterator (SGraphNode node) const = 0
virtual SNodeIter get_node_predecessor_iterator (SGraphNode node) const = 0
virtual SEdgeIter get_edge_iterator () const
bool has_parent (SGraphNode node)
virtual SGraphNode create_node ()
virtual void remove_node_successor_edges (SGraphNode node)
virtual void remove_node_predecessor_edges (SGraphNode node)
virtual void add_all_node_successor_edges (SGraphNode node)
virtual void add_all_node_predecessor_edges (SGraphNode node)
virtual void add_all_edges ()
virtual bool node_has_successors (SGraphNode node) const
virtual bool node_has_predecessors (SGraphNode node) const
virtual void add_nodes_from_sgraph (const SGraph *SGraph)
virtual void add_nodes_from_bits (const BitVector *bits)
virtual void add_nodes_from_list (SGraphNodeList *list)
virtual void remove_nodes_from_sgraph (const SGraph *SGraph)
virtual void remove_nodes_from_bits (const BitVector *bits)
virtual void remove_nodes_from_list (SGraphNodeList *list)
virtual bool is_node_subset_in_sgraph (const SGraph *SGraph)
virtual bool is_node_subset_in_bits (const BitVector *bits)
virtual bool is_node_subset_in_list (SGraphNodeList *list)
virtual BitVector* new_node_set () const
virtual SGraphNodeList* new_node_list () const
virtual bool is_edge_member (const SGraphEdge &edge, bool do_forward) const
virtual void add_edge (const SGraphEdge &edge, bool do_forward)
virtual void remove_edge (const SGraphEdge &edge, bool do_forward)
virtual void print_edge (ion *out, const SGraphEdge &edge, bool do_forward) const
virtual SNodeIter get_node_successor_iterator (SGraphNode node, bool do_forward) const
virtual SNodeIter get_node_predecessor_iterator (SGraphNode node, bool do_forward) const
virtual void remove_node_successor_edges (SGraphNode node, bool do_forward)
virtual void remove_node_predecessor_edges (SGraphNode node, bool do_forward)
virtual void add_all_node_successor_edges (SGraphNode node, bool do_forward)
virtual void add_all_node_predecessor_edges (SGraphNode node, bool do_forward)
virtual bool node_has_successors (SGraphNode node, bool do_forward) const
virtual bool node_has_predecessors (SGraphNode node, bool do_forward) const

Protected Methods

SGraph& operator= (const SGraph &)

Detailed Description

Constructor & Destructor Documentation

SGraph::~SGraph () [virtual]

Member Function Documentation

void SGraph::add_all_edges () [virtual]

Reimplemented in SGraphBit.

void SGraph::add_all_node_predecessor_edges ( SGraphNode node,
bool do_forward) [virtual]

void SGraph::add_all_node_predecessor_edges ( SGraphNode node) [virtual]

Reimplemented in SGraphBit.

void SGraph::add_all_node_successor_edges ( SGraphNode node,
bool do_forward) [virtual]

void SGraph::add_all_node_successor_edges ( SGraphNode node) [virtual]

Reimplemented in SGraphBit.

void SGraph::add_edge ( const SGraphEdge & edge,
bool do_forward) [virtual]

virtual void SGraph::add_edge ( const SGraphEdge & edge) [pure virtual]

Reimplemented in NGraphBase, SGraphBit, SGraphBitSubgraph, SGraphList, and SuperGraph.

virtual void SGraph::add_node ( SGraphNode node) [pure virtual]

Reimplemented in NGraphBase, SGraphBit, SGraphBitSubgraph, SGraphList, and SuperGraph.

void SGraph::add_nodes_from_bits ( const BitVector * bits) [virtual]

void SGraph::add_nodes_from_list ( SGraphNodeList * lst) [virtual]

void SGraph::add_nodes_from_sgraph ( const SGraph * SGraph) [virtual]

SGraphNode SGraph::create_node () [virtual]

SEdgeIter SGraph::get_edge_iterator () const [virtual]

virtual SNodeIter SGraph::get_node_iterator () const [pure virtual]

Reimplemented in NGraphBase, NGraphSubgraph, SGraphBit, SGraphBitSubgraph, SGraphList, and SuperGraph.

SNodeIter SGraph::get_node_predecessor_iterator ( SGraphNode node,
bool do_forward) const [virtual]

virtual SNodeIter SGraph::get_node_predecessor_iterator ( SGraphNode node) const [pure virtual]

Reimplemented in NGraphBase, NGraphSubgraph, SGraphBit, SGraphBitSubgraph, SGraphList, and SuperGraph.

SNodeIter SGraph::get_node_successor_iterator ( SGraphNode node,
bool do_forward) const [virtual]

virtual SNodeIter SGraph::get_node_successor_iterator ( SGraphNode node) const [pure virtual]

Reimplemented in NGraphBase, NGraphSubgraph, SGraphBit, SGraphBitSubgraph, SGraphList, and SuperGraph.

bool SGraph::has_parent ( SGraphNode node)

bool SGraph::is_edge_member ( const SGraphEdge & edge,
bool do_forward) const [virtual]

virtual bool SGraph::is_edge_member ( const SGraphEdge & edge) const [pure virtual]

Reimplemented in NGraphBase, SGraphBit, SGraphBitSubgraph, SGraphList, and SuperGraph.

virtual bool SGraph::is_node_member ( SGraphNode node) const [pure virtual]

Reimplemented in NGraphBase, SGraphBit, SGraphBitSubgraph, SGraphList, and SuperGraph.

bool SGraph::is_node_subset_in_bits ( const BitVector * bits) [virtual]

bool SGraph::is_node_subset_in_list ( SGraphNodeList * lst) [virtual]

bool SGraph::is_node_subset_in_sgraph ( const SGraph * SGraph) [virtual]

virtual SGraphNode SGraph::max_num_nodes () const [pure virtual]

Reimplemented in NGraphBase, SGraphBit, SGraphBitSubgraph, SGraphList, and SuperGraph.

SGraphNodeList * SGraph::new_node_list () const [virtual]

BitVector * SGraph::new_node_set () const [virtual]

Reimplemented in SGraphBit, SGraphBitSubgraph, and SGraphList.

bool SGraph::node_has_predecessors ( SGraphNode node,
bool do_forward) const [virtual]

bool SGraph::node_has_predecessors ( SGraphNode node) const [virtual]

Reimplemented in SGraphList.

bool SGraph::node_has_successors ( SGraphNode node,
bool do_forward) const [virtual]

bool SGraph::node_has_successors ( SGraphNode node) const [virtual]

Reimplemented in SGraphBit, and SGraphList.

SGraph& SGraph::operator= ( const SGraph &) [protected]

void SGraph::print ( ion * out) const [virtual]

void SGraph::print_debug () const [virtual]

void SGraph::print_edge ( ion * out,
const SGraphEdge & edge,
bool do_forward) const [virtual]

void SGraph::print_edge ( ion * out,
const SGraphEdge & edge) const [virtual]

Reimplemented in SGraphBit.

void SGraph::print_node ( ion * out,
SGraphNode node) const [virtual]

Reimplemented in SGraphBit.

void SGraph::remove_edge ( const SGraphEdge & edge,
bool do_forward) [virtual]

virtual void SGraph::remove_edge ( const SGraphEdge & edge) [pure virtual]

Reimplemented in NGraphBase, SGraphBit, SGraphBitSubgraph, SGraphList, and SuperGraph.

virtual void SGraph::remove_node ( SGraphNode node) [pure virtual]

Reimplemented in NGraphBase, SGraphBit, SGraphBitSubgraph, SGraphList, and SuperGraph.

void SGraph::remove_node_predecessor_edges ( SGraphNode node,
bool do_forward) [virtual]

void SGraph::remove_node_predecessor_edges ( SGraphNode node) [virtual]

Reimplemented in SGraphBit.

void SGraph::remove_node_successor_edges ( SGraphNode node,
bool do_forward) [virtual]

void SGraph::remove_node_successor_edges ( SGraphNode node) [virtual]

Reimplemented in SGraphBit.

void SGraph::remove_nodes_from_bits ( const BitVector * bits) [virtual]

void SGraph::remove_nodes_from_list ( SGraphNodeList * lst) [virtual]

void SGraph::remove_nodes_from_sgraph ( const SGraph * graph) [virtual]

The documentation for this class was generated from the following files:
Generated at Mon Jul 31 13:44:29 2000 for NCI SUIF by doxygen 1.1.2 written by Dimitri van Heesch, © 1997-2000