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

SGraphList Class Reference

#include <sgraph_list.h>

Inheritance diagram for SGraphList:

SGraph List of all members.

Public Methods

 SGraphList ()
 SGraphList (const SGraphList &)
SGraphList& operator= (const SGraphList &)
 ~SGraphList ()
virtual SGraphNode max_num_nodes () const
virtual bool is_node_member (SGraphNode node) const
virtual void add_node (SGraphNode node)
virtual void remove_node (SGraphNode node)
virtual bool is_edge_member (const SGraphEdge &edge) const
virtual void add_edge (const SGraphEdge &edge)
virtual void remove_edge (const SGraphEdge &edge)
virtual SNodeIter get_node_iterator () const
virtual SNodeIter get_node_successor_iterator (SGraphNode node) const
virtual SNodeIter get_node_predecessor_iterator (SGraphNode node) const
virtual BitVector* new_node_set () const
virtual bool node_has_successors (SGraphNode node) const
virtual bool node_has_predecessors (SGraphNode node) const

Static Public Methods

bool list_contains (SGraphNodeList *list, SGraphNode node)
void list_remove (SGraphNodeList *list, SGraphNode node)

Detailed Description

Constructor & Destructor Documentation

SGraphList::SGraphList ()

SGraphList::SGraphList ( const SGraphList &)

SGraphList::~SGraphList ()

Member Function Documentation

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

Reimplemented from SGraph.

void SGraphList::add_node ( SGraphNode node) [virtual]

Reimplemented from SGraph.

SNodeIter SGraphList::get_node_iterator () const [virtual]

Reimplemented from SGraph.

SNodeIter SGraphList::get_node_predecessor_iterator ( SGraphNode node) const [virtual]

Reimplemented from SGraph.

SNodeIter SGraphList::get_node_successor_iterator ( SGraphNode node) const [virtual]

Reimplemented from SGraph.

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

Reimplemented from SGraph.

bool SGraphList::is_node_member ( SGraphNode node) const [virtual]

Reimplemented from SGraph.

bool SGraphList::list_contains ( SGraphNodeList * l,
SGraphNode node) [static]

void SGraphList::list_remove ( SGraphNodeList * l,
SGraphNode node) [static]

SGraphNode SGraphList::max_num_nodes () const [virtual]

Reimplemented from SGraph.

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

Reimplemented from SGraph.

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

Reimplemented from SGraph.

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

Reimplemented from SGraph.

SGraphList& SGraphList::operator= ( const SGraphList &)

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

Reimplemented from SGraph.

void SGraphList::remove_node ( SGraphNode node) [virtual]

Reimplemented from SGraph.

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