classvat_3_01graph__prop_00_01v__fk1__mine__prop_00_01st_01_4.tex

这是一个用于数据挖掘的常用算法的模板库（数据挖掘的C++模板库for UNIX)

\section{vat$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$ Class Template Reference}
\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4}\index{vat< GRAPH_PROP, V_Fk1_MINE_PROP, ST >@{vat$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$}}
Graph VAT class by partial specialization of the generic VAT class.  


{\tt \#include $<$graph\_\-vat.h$>$}

\subsection*{Public Types}
\begin{CompactItemize}
\item 
typedef {\bf evat} {\bf EVAT}\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_w0}

\item 
typedef {\bf vat}$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$ {\bf VAT}\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_w1}

\item 
typedef ST$<$ {\bf EVAT} $>$ {\bf RMP\_\-VATS}\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_w2}

\item 
typedef ST$<$ pair$<$ int, RMP\_\-VATS $>$ $>$ {\bf GVAT}
\item 
typedef HASHNS::hash\_\-set$<$ int $>$ {\bf VSET}
\item 
typedef vector$<$ vector$<$ {\bf VSET} $>$ $>$ {\bf VSETS}
\item 
typedef GVAT::const\_\-iterator {\bf CONST\_\-IT}\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_w6}

\item 
typedef GVAT::iterator {\bf IT}\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_w7}

\item 
typedef ST$<$ {\bf EVAT} $>$::const\_\-iterator {\bf CONST\_\-EIT}\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_w8}

\end{CompactItemize}
\subsection*{Public Member Functions}
\begin{CompactItemize}
\item 
IT {\bf begin} ()\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a0}

\item 
CONST\_\-IT {\bf begin} () const \label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a1}

\item 
IT {\bf end} ()\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a2}

\item 
CONST\_\-IT {\bf end} () const \label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a3}

\item 
VSETS::iterator {\bf begin\_\-v} ()\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a4}

\item 
VSETS::const\_\-iterator {\bf begin\_\-v} () const \label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a5}

\item 
VSETS::iterator {\bf end\_\-v} ()\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a6}

\item 
VSETS::const\_\-iterator {\bf end\_\-v} () const \label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a7}

\item 
int {\bf size} () const \label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a8}

\item 
bool {\bf empty} () const \label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a9}

\item 
const  pair$<$ int, ST$<$ {\bf EVAT} $>$ $>$ \& {\bf back} () const \label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a10}

\item 
void {\bf insert\_\-occurrence\_\-tid} (const  int \&tid, const  pair$<$ int, int $>$ \&new\_\-occurrence)\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a11}

\item 
void {\bf insert\_\-occurrence\_\-evat} (const  pair$<$ int, int $>$ \&new\_\-occurrence)\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a12}

\item 
void {\bf insert\_\-occurrence} (const  pair$<$ int, int $>$ \&new\_\-occurrence)\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a13}

\item 
void {\bf insert\_\-vid\_\-hs} (const  int \&vid)\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a14}

\item 
void {\bf insert\_\-vid} (const  int \&vid)\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a15}

\item 
void {\bf insert\_\-vid\_\-tid} (const  int \&vid)\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a16}

\item 
void {\bf copy\_\-vats} (const  pair$<$ int, ST$<$ {\bf evat} $>$ $>$ \&v1, const  int \&offset, const  int \&sz, bool swap=0)\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a17}

\item 
void {\bf copy\_\-vats\_\-tid} (const  pair$<$ int, ST$<$ {\bf evat} $>$ $>$ \&v1, const  int \&offset, const  int \&sz, bool swap=0)\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a18}

\item 
void {\bf copy\_\-vids\_\-hs} (const  {\bf VSET} \&v1\_\-vids)\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a19}

\item 
void {\bf copy\_\-vids\_\-tid} (const  {\bf VSET} \&v1\_\-vids)\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a20}

\item 
bool {\bf is\_\-new\_\-vertex} (const  int \&vid, const  int \&tid, const  int \&offset) const 
\end{CompactItemize}
\subsection*{Static Public Member Functions}
\begin{CompactItemize}
\item 
template$<$typename PATTERN, typename PAT\_\-SUP$>$ {\bf VAT} $\ast$$\ast$ {\bf intersection} (const  {\bf VAT} $\ast$v1, const  {\bf VAT} $\ast$v2, PAT\_\-SUP $\ast$$\ast$cand\_\-sups, PATTERN $\ast$$\ast$cand\_\-pats, bool)
\end{CompactItemize}
\subsection*{Friends}
\begin{CompactItemize}
\item 
class {\bf evat}\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_n0}

\item 
ostream \& {\bf operator$<$$<$} (ostream \&, const  {\bf VAT} $\ast$)\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_n1}

\end{CompactItemize}


\subsection{Detailed Description}
\subsubsection*{template$<$typename PP, typename MP, template$<$ typename $>$ class ST$>$ class vat$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$}

Graph VAT class by partial specialization of the generic VAT class. 

In this partial specialization, PP is fixed to undirected (undirected graph property), MP is fixed to Fk X F1 and vert\_\-mine (vertical mining with FK X F1), ST is the VAT storage type. For graph, ST should model a vector, else this shall not compile. 



\subsection{Member Typedef Documentation}
\index{vat< GRAPH_PROP, V_Fk1_MINE_PROP, ST >@{vat$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$}!GVAT@{GVAT}}
\index{GVAT@{GVAT}!vat< GRAPH_PROP, V_Fk1_MINE_PROP, ST >@{vat$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$typename PP, typename MP, template$<$ typename $>$ class ST$>$ typedef ST$<$pair$<$int, RMP\_\-VATS$>$ $>$ {\bf vat}$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$::{\bf GVAT}}\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_w3}


a graph-vat is a collection of evats for each vertex, where each evat must have same size. This collection of evats is organized itself as ST$<$EVAT$>$ evats, and it holds evats of all edges on right most path of cand\_\-pat \index{vat< GRAPH_PROP, V_Fk1_MINE_PROP, ST >@{vat$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$}!VSET@{VSET}}
\index{VSET@{VSET}!vat< GRAPH_PROP, V_Fk1_MINE_PROP, ST >@{vat$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$typename PP, typename MP, template$<$ typename $>$ class ST$>$ typedef HASHNS::hash\_\-set$<$int$>$ {\bf vat}$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$::{\bf VSET}}\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_w4}


Set of vertex ids denoting exactly one of this graph's occurence in the dataset \index{vat< GRAPH_PROP, V_Fk1_MINE_PROP, ST >@{vat$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$}!VSETS@{VSETS}}
\index{VSETS@{VSETS}!vat< GRAPH_PROP, V_Fk1_MINE_PROP, ST >@{vat$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$typename PP, typename MP, template$<$ typename $>$ class ST$>$ typedef vector$<$vector$<${\bf VSET}$>$ $>$ {\bf vat}$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$::{\bf VSETS}}\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_w5}


This graph can occur several times in one graph in the dataset, and in several graphs (tids) as well 

\subsection{Member Function Documentation}
\index{vat< GRAPH_PROP, V_Fk1_MINE_PROP, ST >@{vat$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$}!intersection@{intersection}}
\index{intersection@{intersection}!vat< GRAPH_PROP, V_Fk1_MINE_PROP, ST >@{vat$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$typename PP, typename MP, template$<$ typename $>$ class ST$>$ template$<$typename PATTERN, typename PAT\_\-SUP$>$ {\bf VAT}$\ast$$\ast$ {\bf vat}$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$::intersection (const {\bf VAT} $\ast$ {\em v1}, const {\bf VAT} $\ast$ {\em v2}, PAT\_\-SUP $\ast$$\ast$ {\em cand\_\-sups}, PATTERN $\ast$$\ast$ {\em cand\_\-pats}, bool)\hspace{0.3cm}{\tt  [inline, static]}}\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_e0}


Main vat intersection function; It also populates support argument passed

we now have both evats, intersect them ///

now determine the index of edge\_\-vid on rmp of candidate. This is used by back\_\-intersect. \index{vat< GRAPH_PROP, V_Fk1_MINE_PROP, ST >@{vat$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$}!is_new_vertex@{is\_\-new\_\-vertex}}
\index{is_new_vertex@{is\_\-new\_\-vertex}!vat< GRAPH_PROP, V_Fk1_MINE_PROP, ST >@{vat$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$typename PP, typename MP, template$<$ typename $>$ class ST$>$ bool {\bf vat}$<$ GRAPH\_\-PROP, V\_\-Fk1\_\-MINE\_\-PROP, ST $>$::is\_\-new\_\-vertex (const int \& {\em vid}, const int \& {\em tid}, const int \& {\em offset}) const\hspace{0.3cm}{\tt  [inline]}}\label{classvat_3_01GRAPH__PROP_00_01V__Fk1__MINE__PROP_00_01ST_01_4_a21}


Returns true if vid occurs in any of the offset-th vids in tid-th vat 

The documentation for this class was generated from the following file:\begin{CompactItemize}
\item 
graph\_\-vat.h\end{CompactItemize}