\begin{minipage}[t]{8in}
\begin{tabular}{ll}
  & \verb+~+\Edge\index{Edge!\verb+~+\Edge}()
\end{tabular}\\

		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in} The destructor for the vertex \Collection\ object is
		  called. \end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Bool  & hasVertex\index{Edge!hasVertex}(Vertex* v)
\end{tabular}\\
 
		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in} Returns TRUE is $v$ is a member of the vertex \Collection.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Vertex*  &  sourceVertex\index{Edge! sourceVertex}() 
\end{tabular}\\
 
		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in} Returns a pointer to the first \Vertex\ object in the
		  vertex \Collection.\ Note that this implies that it 
		  returns the smallest \Vertex\ object in lexicographic
		  order if the \Collection\ is a \Set. The time complexity
		  depends on the \Container\ used to store the elements.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Vertex*  &  sinkVertex\index{Edge! sinkVertex}() 
\end{tabular}\\
 
		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in} Returns a pointer to the {\em last} \Vertex\ object in the
		  vertex \Collection.\ Note that this implies that it 
		  returns the largest \Vertex\ object in lexicographic
		  order if the \Collection\ is a \Set. The time complexity
		  depends on the \Container\ used to store the elements.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Sequence$<$Vertex$>$  &  otherVertices\index{Edge! otherVertices}(Vertex* v) 
\end{tabular}\\
 
		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in} Return a \Sequence\ object containing all vertices in the
		  edge except $v$ (in the same order in which they appear
		  in the edge). $O(s)$, where $s$ is the cardinality of
		  the largest edge.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
void  & replace\index{Edge!replace}(Vertex *old\_v, Vertex *new\_v)
\end{tabular}\\
 
		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in} This method is used by the \MHyperGraph\ methods to 
		  manipulate subgraphs.  It should never be called by
		  the programmer.  NEEDS TO BE MADE PRIVATE, BUT THE
		  PROBLEM IS THAT THE PARSER NEEDS ACCESS. \end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Collection$<$Vertex*$>$*     & vertices()\index{Edge!vertices()} const
\end{tabular}\\

		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in} Return a pointer to the \Collection\ of vertices. $O(1)$\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
DataType  & type\index{Edge!type}() const
\end{tabular}\\

		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Return either EDGEUND or EDGEDIR depending on the type
		 of \Collection\ used to store vertices.  (see general.h)
		 It shouldn't normally be necessary to call this.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Bool operator==(const Vertex\&) const
  \\
Bool operator$<$=(const Vertex\&) const
  \\
Bool operator$<$ (const Vertex\&) const
  \\
Bool operator$>$=(const Vertex\&) const
  \\
Bool operator$>$ (const Vertex\&) const
  \\
Bool operator!=(const Vertex\&) const
\end{tabular}\\

		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Compare the current edge with another based on 
		 lexicographic ordering of edge names.\end{minipage}
\end{minipage}
\vspace{0.2in}



\begin{minipage}[t]{8in}
\begin{tabular}{ll}
void  & saveToFile\index{Edge!saveToFile}(ofstream\& fout, int indent)
\end{tabular}\\
 
		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}This method outputs the infomation associated with the
		 current edge, including its attributes.  It is not
		 generally called by the programmer;  
		 {\em MHyperGraph::saveToFile()} calls it while writing
		 out a graph.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
friend ostream\&  & operator$<$$<$ \index{Edge!operator$<$$<$ }(ostream\& stream, const Edge\& v)
\end{tabular}\\
 
		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Output the \Collection\ containing the vertices
		 to a stream.\end{minipage}
\end{minipage}
\vspace{0.2in}