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

NGraph Class Reference

#include <ngraph.h>

Inheritance diagram for NGraph:

List of all members.

Public Methods

virtual bool is_nnode_member (T *nnode) const = 0

virtual SGraphNode add_nnode (T *nnode) = 0

virtual void remove_nnode (T *nnode)

virtual T* get_nnode_from_node (SGraphNode node) const = 0

virtual SGraphNode get_node_from_nnode (T *nnode) const = 0

virtual void print_nnode (ion *out, T *nnode) const

virtual bool is_nedge_member (const NEdge<T>& edge) const

virtual void add_nedge (const NEdge<T>& edge)

virtual void remove_nedge (const NEdge<T>& edge)

virtual void print_nedge (ion *out, const NEdge<T>& edge) const

virtual NGraphNNodeIter<T>* get_nnode_iterator () const

virtual NGraphNNodeIter<T>* get_nnode_successor_iterator (T *nnode) const

virtual NGraphNNodeIter<T>* get_nnode_predecessor_iterator (T *nnode) const

virtual void remove_nnode_successor_edges (T *nnode)

virtual void remove_nnode_predecessor_edges (T *nnode)

virtual void add_all_nnode_successor_edges (T *nnode)

virtual void add_all_nnode_predecessor_edges (T *nnode)

virtual bool nnode_has_successors (T *nnode) const

virtual bool nnode_has_predecessors (T *nnode) const

virtual bool is_nedge_member (const NEdge<T>& edge, bool do_forward) const

virtual void add_nedge (const NEdge<T>& edge, bool do_forward)

virtual void remove_nedge (const NEdge<T>& edge, bool do_forward )

virtual void print_nedge (ion *out, const NEdge<T>& edge, bool do_forward) const

virtual NGraphNNodeIter<T>* get_nnode_successor_iterator (T *nnode, bool do_forward) const

virtual NGraphNNodeIter<T>* get_nnode_predecessor_iterator (T *nnode, bool do_forward) const

virtual void remove_nnode_successor_edges (T *nnode, bool do_forward)

virtual void remove_nnode_predecessor_edges (T *nnode, bool do_forward)

virtual void add_all_nnode_successor_edges (T *nnode, bool do_forward)

virtual void add_all_nnode_predecessor_edges (T *nnode, bool do_forward)

virtual bool nnode_has_successors (T *nnode, bool do_forward) const

virtual bool nnode_has_predecessors (T *nnode, bool do_forward) const

Detailed Description

template<class T> class NGraph

Member Function Documentation

template<class T>
void NGraph<T>::add_all_nnode_predecessor_edges ( T * nnode,

bool do_forward) [inline, virtual]

template<class T>
void NGraph<T>::add_all_nnode_predecessor_edges ( T * nnode) [virtual]

template<class T>
void NGraph<T>::add_all_nnode_successor_edges ( T * nnode,

bool do_forward) [inline, virtual]

template<class T>
void NGraph<T>::add_all_nnode_successor_edges ( T * nnode) [virtual]

template<class T>
void NGraph<T>::add_nedge ( const NEdge<T>& edge,

bool do_forward) [inline, virtual]

template<class T>
void NGraph<T>::add_nedge ( const NEdge<T>& edge) [virtual]

template<class T>
virtual SGraphNode NGraph<T>::add_nnode ( T * nnode) [pure virtual]

Reimplemented in NGraphBase, and NGraphSubgraph.

template<class T>
virtual T* NGraph<T>::get_nnode_from_node ( SGraphNode node) const [pure virtual]

Reimplemented in NGraphBase, and NGraphSubgraph.

template<class T>
NGraphNNodeIter<T>* NGraph<T>::get_nnode_iterator () const [virtual]

template<class T>
NGraphNNodeIter<T>* NGraph<T>::get_nnode_predecessor_iterator<T> ( T * nnode,

bool do_forward) const [inline, virtual]

template<class T>
NGraphNNodeIter<T>* NGraph<T>::get_nnode_predecessor_iterator ( T * nnode) const [virtual]

template<class T>
NGraphNNodeIter<T>* NGraph<T>::get_nnode_successor_iterator<T> ( T * nnode,

bool do_forward) const [inline, virtual]

template<class T>
NGraphNNodeIter<T>* NGraph<T>::get_nnode_successor_iterator ( T * nnode) const [virtual]

template<class T>
virtual SGraphNode NGraph<T>::get_node_from_nnode ( T * nnode) const [pure virtual]

Reimplemented in NGraphBase, and NGraphSubgraph.

template<class T>
bool NGraph<T>::is_nedge_member ( const NEdge<T>& edge,

bool do_forward) const [inline, virtual]

template<class T>
bool NGraph<T>::is_nedge_member ( const NEdge<T>& edge) const [virtual]

template<class T>
virtual bool NGraph<T>::is_nnode_member ( T * nnode) const [pure virtual]

Reimplemented in NGraphBase.

template<class T>
bool NGraph<T>::nnode_has_predecessors ( T * nnode,

bool do_forward) const [inline, virtual]

template<class T>
bool NGraph<T>::nnode_has_predecessors ( T * nnode) const [virtual]

template<class T>
bool NGraph<T>::nnode_has_successors ( T * nnode,

bool do_forward) const [inline, virtual]

template<class T>
bool NGraph<T>::nnode_has_successors ( T * nnode) const [virtual]

template<class T>
void NGraph<T>::print_nedge ( ion * out,

const NEdge<T>& edge,

bool do_forward) const [inline, virtual]

template<class T>
void NGraph<T>::print_nedge ( ion * out,

const NEdge<T>& edge) const [virtual]

template<class T>
void NGraph<T>::print_nnode ( ion * out,

T * nnode) const [virtual]

Reimplemented in NGraphSubgraph.

template<class T>
void NGraph<T>::remove_nedge ( const NEdge<T>& edge,

bool do_forward) [inline, virtual]

template<class T>
void NGraph<T>::remove_nedge ( const NEdge<T>& edge) [virtual]

template<class T>
void NGraph<T>::remove_nnode ( T * nnode) [virtual]

Reimplemented in NGraphBase, and NGraphSubgraph.

template<class T>
void NGraph<T>::remove_nnode_predecessor_edges ( T * nnode,

bool do_forward) [inline, virtual]

template<class T>
void NGraph<T>::remove_nnode_predecessor_edges ( T * nnode) [virtual]

template<class T>
void NGraph<T>::remove_nnode_successor_edges ( T * nnode,

bool do_forward) [inline, virtual]

template<class T>
void NGraph<T>::remove_nnode_successor_edges ( T * nnode) [virtual]

The documentation for this class was generated from the following file:

nci/suif/suif2b/extratypes/sgraph/ngraph.h

Generated at Mon Jul 31 13:44:07 2000 for NCI SUIF by

1.1.2 written by Dimitri van Heesch, © 1997-2000