Polaris: SimBiGraph.h Source File

SimBiGraph.h Go to the documentation of this file. /// #ifndef _SIMBIGRAPH_H #define _SIMBIGRAPH_H /// /// \class SimBiGraph /// \brief a class for a bipartite Similarity graph /// \defgroup Base /// \ingroup Base /// General utility routines /// \see SimBiGraph.h /// \see SimBiGraph.cc /// \see SimBiGraph.h /// /// \endcode /// \section Description Description /// This module contains the structures needed to represent /// a Similarity graph for two sets of access descriptors. /// 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, etc), /// 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 SimGraph because in the SimGraph, there is /// only one set of descriptors. In the SimBiGraph, the _graph can be /// viewed as an complete "adjacency" matrix. 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 SimGraph that means the relationship between node i and node j. /// /// So, in the SimGraph, ((*_graph)[i])[j] and ((*_graph)[j])[i] /// are really between the same two nodes, but representing the /// relationship viewed from opposite ends of the single edge. /// /// 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. /// /// \endcode /// \section KNOWN KNOWN/POSSIBLE BUGS/LIMITATIONS /// #ifdef POLARIS_GNU_PRAGMAS #pragma interface #endif /// #include "ClassNames.h" #include "Listable.h" #include "SimEdgeKernel.h" #include "SimBiGraph.h" #include "SimEdge.h" #include "Array.h" #include "AbstractAccess.h" #include "Collection/RefElement.h" #include "Range/RangeAccessor.h" /// class SimBiGraphIterator; class SimBiGraph : public Listable { friend class SimBiGraphIterator; protected: Array< RefElement< AbstractAccess > > * _ptrs1;///< pointers to the descriptors for the nodes from list 1 Array< RefElement< AbstractAccess > > * _ptrs2;///< pointers to the descriptors for the nodes from list 2 Array< Array< SimEdgeKernel > > * _graph; ///< adjacency matrix short _nodes1; ///< Number of access descriptors, list 1 short _nodes2; ///< Number of access descriptors, list 2 RangeAccessor * _range_acc; ///< RangeAccessor for doing comparisons among the descriptors public: SimBiGraph( ); SimBiGraph( const SimBiGraph & ); SimBiGraph(List<AbstractAccess> & list1, List<AbstractAccess> & list2); ///< make a Similarity graph between two lists ~SimBiGraph( ); int nodes1( ); ///< return the number of nodes in list 1 of the graph int nodes2( ); ///< return the number of nodes in list 2 of the graph SimEdgeKernel & kernel(int i, int j); ///< Return the SimEdgeKernel corresponding to edge (i,j) 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); RangeAccessor * range_acc( ); ///< return the RangeAccessor void calc_similarity( int node1, int node2 ); ///< Calculate the similarity relationship between two nodes in graph ///< node1 from list 1 and node2 from list 2 void print_similarities( ) const; void redo_spanmatch( SimEdge & edge, int which_node, int which_dim ); virtual SimBiGraph *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 SimBiGraph & ad); }; #endif

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