Polaris: SimGraph.h Source File

SimGraph.h Go to the documentation of this file. #ifndef _SIMGRAPH_H #define _SIMGRAPH_H /// /// \class SimGraph /// \brief a class for a Similarity graph /// \defgroup Base /// \ingroup Base /// General utility routines /// \see SimGraph.h /// \see SimGraph.cc /// \see SimGraph.h /// /// \endcode /// \section Description Description /// This module contains the structures needed to represent /// a Similarity graph. This is a complete graph (in the sense /// that there are edges between all possible pairs of nodes) /// in which the nodes represent access descriptors and the edges /// contain information about the similarity between the descriptors. /// /// The similarity information consists of a similarity type /// (equivalent, dimension-equivalent, stride-equivalent, not-similar), /// and for those that are not not-similar, a matching is given /// showing which dimensions match between the two descriptors. /// /// This is different from the SimBiGraph because in the SimBiGraph, there are /// two sets of descriptors. In the SimGraph, the _graph can be /// viewed as an complete "adjacency" matrix for a single set of nodes. /// All nodes are "adjacent" to all others. In other words, each node /// of one set has a connection to all nodes of the other set. The _graph /// is indexed in a two-dimensional way, e.g. ((*_graph)[i])[j], in both the /// SimGraph and the SimBiGraph, but in the SimBiGraph that means the /// relationship between node i of the first set and node j of the second set. /// /// So, in the SimBiGraph, ((*_graph)[i])[j] and ((*_graph)[j])[i], /// the first represents the relationship between node i of the first set /// and node j of the second set. The second represents the relationship /// between node j of the first set and node i of the second set, which /// are two completely different pairs of nodes. /// /// In the SimGraph, ((*_graph)[i])[j] and ((*_graph)[j])[i] /// really represent the relationship between the same two nodes, but /// viewed from opposite ends of the single edge. /// /// /// /// \endcode /// \section KNOWN KNOWN/POSSIBLE BUGS/LIMITATIONS /// #ifdef POLARIS_GNU_PRAGMAS #pragma interface #endif /// #include "ClassNames.h" #include "Listable.h" #include "SimEdgeKernel.h" #include "SimEdge.h" #include "Array.h" #include "AbstractAccess.h" #include "Collection/RefElement.h" #include "Range/RangeAccessor.h" /// enum SimTypeOfChange { SIM_NOCHANGE, SIM_EQUIVALENCE, SIM_SUBREG_NODE1, SIM_SUBREG_NODE2, SIM_COALESCE_NODE1, SIM_COALESCE_NODE2, SIM_CONTIG_NODE1, SIM_CONTIG_NODE2 }; /// class SimGraphIterator; class SimGraph : public Listable { friend class SimGraphIterator; protected: Array< bool > * _descr_exists; ///< Whether the given descriptor exists Array< RefElement< AbstractAccess > > * _ptrs;///< pointers to the descriptors for the nodes Array< Array< SimEdgeKernel > > * _graph; ///< adjacency matrix short _nodes; ///< Number of access descriptors, list 1 RangeAccessor * _range_acc; ///< RangeAccessor for doing comparisons among the descriptors public: SimGraph( ); SimGraph( const SimGraph & ); SimGraph( List<AbstractAccess> & list ); ///< make a complete graph with given number of nodes ~SimGraph( ); int nodes( ); ///< return the number of nodes in the graph ///< add edges determined by transitivity (a = b && b = c ==> a = c) void _add_corresp_edge_forward(SimilarityType type, int index_new, int index_mid, int index_old, Array<int> * stride_match, Array<bool> * span_match); void _add_corresp_edge_backward(SimilarityType type, int index_old, int index_mid, int index_new, Array<int> * stride_match, Array<bool> * span_match); SimEdgeKernel & kernel(int i, int j); ///< Return the SimEdgeKernel corresponding to edge (i,j) in the graph. RangeAccessor * range_acc( ); ///< return the RangeAccessor void calc_similarity( int node1, int node2 ); ///< Calculate the similarity relationship between two nodes in graph void set_ptr(int i, AbstractAccess & aa); ///< Set a given ptr element void print_similarities( ) const; void redo_spanmatch( SimEdge & edge, int which_node, int which_dim ); void set_unknown( SimEdge & edge, int which_node); virtual SimGraph *clone() const; ///< This one is to satisfy Listable virtual void print(ostream & o) const; virtual Listable *listable_clone() const; friend ostream & operator << (ostream & o, const SimGraph & ad); }; #endif

© 1995-2005 University of Illinois, Urbana-Champaign. All rights reserved.  Fri Mar 25 23:06:07 2005