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

		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in} Clears the edge set before deleting the current \Vertex\
		  object.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
void  & addEdge\index{Vertex!addEdge}(Edge* passed\_edge)
\end{tabular}\\
 
		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Add {\em passed\_edge}, which has already been constructed,
		  to the edge set.  NOTE: THIS METHOD SHOULD BE 
		  PRIVATE, BUT IT CANNOT BE RIGHT NOW SINCE THE FILE
		  FORMAT PARSER CALLS IT (THE REASON FOR THE EXISTENCE OF
		  THIS METHOD IS TO MANIPULATE SUBGRAPHS, WHICH MAY BE
		  STORED. THE SUBGRAPH PROCESSING IN THE GRAPH CLASSES
		  CAN BE ACCOMPLISHED BY MAKING THEM FRIENDS, BUT THE 
		  PARSER IS NOT A CLASS).  PROGRAMMERS SHOULD NEVER
		  CALL THIS.  IT WILL BE MADE PRIVATE EVENTUALLY. \end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
void  & removeEdge\index{Vertex!removeEdge}(Edge* passed\_edge)
\end{tabular}\\
 
		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Remove {\em passed\_edge} from the edge set. NOTE: THE
		 COMMENT ABOVE APPLIES TO THIS METHOD ALSO.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
char*     & name\index{Vertex!name}() const
\end{tabular}\\

		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Retrieve and return the {\em name} attribute of the vertex.\end{minipage}
\end{minipage}
\vspace{0.2in}


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

		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Return VERTEX.  (see general.h)\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
MSet$<$Edge*$>$  & incidentEdges\index{Vertex!incidentEdges}() const
\end{tabular}\\
 
		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Return the edge set.  Note that this is an $O(1)$
		 operation due to the reference counting of the 
		 \Collection\ hierarchy  (Returning a constant
		 reference to the \MSet\ is another alternative,
		 but g++ 2.6.3 does not protect the set in that 
		 case; it only generates a warning).\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Set$<$Vertex*$>$  & neighbors\index{Vertex!neighbors}()
\end{tabular}\\
 
		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}If the graph is undirected, return all of the vertices 
		 which share an edge with 
		 this \Vertex\ object (not including itself), otherwise
		 return outNeighbors(). $O(ds)$,
		 where $d$ is the maximum degree of a vertex in $G$,
		 and $s$ is the maximum cardinality of an edge.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Set$<$Vertex*$>$  & inNeighbors\index{Vertex!inNeighbors}()
\end{tabular}\\
 
		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}For each incident edge, if the edge is directed,
		 find all vertices which occur {\em before} the 
		 current vertex in the sequence.  If the 
		 edge is undirected, return all verticies in the edge
		 other than the current vertex. $O(ds)$, where $d$ and
		 $s$ are defined as above.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Set$<$Vertex*$>$  & outNeighbors\index{Vertex!outNeighbors}()
\end{tabular}\\
 
		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}For each incident edge, if the edge is directed,
		 find all vertices which occur {\em after} the 
		 current vertex in the sequence.  If the 
		 edge is undirected, return all verticies in the edge
		 other than the current vertex. $O(ds)$, where $d$ and
		 $s$ are defined as above.\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 vertex with another based on 
		 lexicographic ordering of vertex names.\end{minipage}
\end{minipage}
\vspace{0.2in}



\begin{minipage}[t]{8in}
\begin{tabular}{ll}
void  & saveToFile\index{Vertex!saveToFile}(ofstream\& fout, int indent)
\end{tabular}\\
 
		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}This method outputs the infomation associated with the
		 current vertex, 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{Vertex!operator$<$$<$ }(ostream\& stream, const Vertex\& v)
\end{tabular}\\
 
		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Output the name of the vertex to a stream.\end{minipage}
\end{minipage}
\vspace{0.2in}