\section{sd\-Vertex  Class Template Reference}
\label{class_sdVertex}\index{sdVertex@{sd\-Vertex}}
{\tt \#include $<$sdvertex.h$>$}

Collaboration diagram for sd\-Vertex:\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=105pt]{class_sdVertex_coll_graph}
\end{center}
\end{figure}
\subsection*{Public Methods}
\begin{CompactItemize}
\item 
{\bf sd\-Vertex} ()
\item 
{\bf sd\-Vertex} (const sd\-Vertex$<$ WT $>$ \&sdv)
\item 
{\bf sd\-Vertex} (int id, int num\_\-out, int num\_\-in)
\item 
{\bf $\sim$sd\-Vertex} ()
\item 
int {\bf Out\-Degree} () const
\item 
int {\bf In\-Degree} () const
\item 
int {\bf Degree} () const
\item 
void {\bf Sort\-Edges} ()
\item 
void {\bf Print\-Out\-Edges} (ostream \&os) const
\item 
void {\bf Print\-In\-Edges} (ostream \&os) const
\item 
void {\bf Print\-Edges} (ostream \&os) const
\item 
const sd\-Vertex$<$WT$>$\& {\bf operator=} (const sd\-Vertex$<$ WT $>$ \&sdv)
\item 
int {\bf Compare} (const sd\-Vertex$<$ WT $>$ \&v) const
\item 
{\bf MAKECOMPARISONS\_\-WITH\_\-COMPARE} (sd\-Vertex$<$ WT $>$)
\item 
const sd\-Vertex$<$WT$>$\& {\bf Get\-Out\-Neighbor} (int i) const
\item 
sd\-Vertex$<$WT$>$\& {\bf Get\-Out\-Neighbor} (int i)
\item 
const sd\-Vertex$<$WT$>$\& {\bf operator[$\,$]} (int i) const
\item 
sd\-Vertex$<$WT$>$\& {\bf operator[$\,$]} (int i)
\item 
const sd\-Vertex$<$WT$>$\& {\bf Get\-In\-Neighbor} (int i) const
\item 
sd\-Vertex$<$WT$>$\& {\bf Get\-In\-Neighbor} (int i)
\item 
const sd\-Vertex$<$WT$>$\& {\bf operator()} (int i) const
\item 
sd\-Vertex$<$WT$>$\& {\bf operator()} (int i)
\item 
int {\bf Get\-Out\-Edge\-Index} (const sd\-Vertex$<$ WT $>$ \&to) const
\item 
int {\bf Get\-Out\-Edge\-Index} (int to\_\-id) const
\item 
int {\bf Get\-In\-Edge\-Index} (const sd\-Vertex$<$ WT $>$ \&from) const
\item 
int {\bf Get\-In\-Edge\-Index} (int from\_\-id) const
\item 
int {\bf Has\-Edge\-To} (const sd\-Vertex$<$ WT $>$ \&to) const
\item 
int {\bf Has\-Edge\-From} (const sd\-Vertex$<$ WT $>$ \&from) const
\item 
const {\bf sd\-Edge}$<$WT$>$\& {\bf Get\-Out\-Edge} (int i) const
\item 
{\bf sd\-Edge}$<$WT$>$\& {\bf Get\-Out\-Edge} (int i)
\item 
const {\bf sd\-Edge}$<$WT$>$\& {\bf Get\-In\-Edge} (int i) const
\item 
{\bf sd\-Edge}$<$WT$>$\& {\bf Get\-In\-Edge} (int i)
\item 
const WT\& {\bf Get\-Out\-Weight} (int i) const
\item 
WT\& {\bf Get\-Out\-Weight} (int i)
\item 
const WT\& {\bf Get\-In\-Weight} (int i) const
\item 
WT\& {\bf Get\-In\-Weight} (int i)
\end{CompactItemize}
\subsection*{Public Attributes}
\begin{CompactItemize}
\item 
int {\bf ID}
\item 
int {\bf Num\-O}
\item 
int {\bf Num\-I}
\item 
{\bf sd\-Edge}$<$WT$>$$\ast$ {\bf Out\-E}
\item 
{\bf sd\-Edge}$<$WT$>$$\ast$ {\bf In\-E}
\end{CompactItemize}
\subsection*{Friends}
\begin{CompactItemize}
\item 
ostream\& {\bf operator} (ostream \&os, const sd\-Vertex$<$ WT $>$ \&vert)
\item 
int {\bf Connected} (const sd\-Vertex$<$ WT $>$ \&v1, const sd\-Vertex$<$ WT $>$ \&v2)
\end{CompactItemize}
\subsubsection*{template$<$class WT = double$>$  class sd\-Vertex}



\subsection{Constructor \& Destructor Documentation}
\index{sdVertex@{sd\-Vertex}!sdVertex@{sdVertex}}
\index{sdVertex@{sdVertex}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT = double$>$ sd\-Vertex$<$WT$>$::sd\-Vertex$<$WT$>$ ()}\label{class_sdVertex_a0}


\index{sdVertex@{sd\-Vertex}!sdVertex@{sdVertex}}
\index{sdVertex@{sdVertex}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT = double$>$ sd\-Vertex$<$WT$>$::sd\-Vertex$<$WT$>$ (const sd\-Vertex$<$ WT $>$ \& {\em sdv})}\label{class_sdVertex_a1}


\index{sdVertex@{sd\-Vertex}!sdVertex@{sdVertex}}
\index{sdVertex@{sdVertex}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT = double$>$ sd\-Vertex$<$WT$>$::sd\-Vertex$<$WT$>$ (int {\em id}, int {\em num\_\-out}, int {\em num\_\-in})}\label{class_sdVertex_a2}


\index{sdVertex@{sd\-Vertex}!~sdVertex@{$\sim$sdVertex}}
\index{~sdVertex@{$\sim$sdVertex}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ sd\-Vertex$<$ WT $>$::$\sim$sd\-Vertex$<$WT$>$ ()\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a3}




Definition at line 81 of file sdvertex.inc.\footnotesize\begin{verbatim}00082   { delete[] OutE; delete[] InE; }
00083 \end{verbatim}\normalsize 


\subsection{Member Function Documentation}
\index{sdVertex@{sd\-Vertex}!Compare@{Compare}}
\index{Compare@{Compare}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ int sd\-Vertex$<$ WT $>$::Compare (const sd\-Vertex$<$ WT $>$ \& {\em v}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a12}




Definition at line 170 of file sdvertex.inc.\footnotesize\begin{verbatim}00171   { return (ID - v.ID); }
00172 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!Degree@{Degree}}
\index{Degree@{Degree}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ int sd\-Vertex$<$ WT $>$::Degree () const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a6}




Definition at line 93 of file sdvertex.inc.\footnotesize\begin{verbatim}00094   { return OutDegree() + InDegree(); }
00095 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetInEdge@{GetInEdge}}
\index{GetInEdge@{GetInEdge}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ {\bf sd\-Edge}$<$ WT $>$ \& sd\-Vertex$<$ WT $>$::Get\-In\-Edge (int {\em i})\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a31}




Definition at line 260 of file sdvertex.inc.\footnotesize\begin{verbatim}00261   { return InE[i]; }
00262 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetInEdge@{GetInEdge}}
\index{GetInEdge@{GetInEdge}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ const {\bf sd\-Edge}$<$ WT $>$ \& sd\-Vertex$<$ WT $>$::Get\-In\-Edge (int {\em i}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a30}




Definition at line 256 of file sdvertex.inc.\footnotesize\begin{verbatim}00257   { return InE[i]; }
00258 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetInEdgeIndex@{GetInEdgeIndex}}
\index{GetInEdgeIndex@{GetInEdgeIndex}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ int sd\-Vertex$<$ WT $>$::Get\-In\-Edge\-Index (int {\em from\_\-id}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a25}




Definition at line 221 of file sdvertex.inc.\footnotesize\begin{verbatim}00222   {
00223     if(!NumI) return -1;
00224 
00225     sdEdge<WT> edge; edge.V = new sdVertex<WT>(from_id, 0, 0);
00226     int index = BinSearch(InE, NumI, edge);
00227     delete edge.V;
00228     return index;
00229 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetInEdgeIndex@{GetInEdgeIndex}}
\index{GetInEdgeIndex@{GetInEdgeIndex}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ int sd\-Vertex$<$ WT $>$::Get\-In\-Edge\-Index (const sd\-Vertex$<$ WT $>$ \& {\em from}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a24}




Definition at line 232 of file sdvertex.inc.

Referenced by Has\-Edge\-From().\footnotesize\begin{verbatim}00233   { return GetInEdgeIndex(from.ID); }
00234 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetInNeighbor@{GetInNeighbor}}
\index{GetInNeighbor@{GetInNeighbor}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ sd\-Vertex$<$ WT $>$ \& sd\-Vertex$<$ WT $>$::Get\-In\-Neighbor (int {\em i})\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a19}




Definition at line 194 of file sdvertex.inc.\footnotesize\begin{verbatim}00195   { return *(InE[i].V); }
00196 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetInNeighbor@{GetInNeighbor}}
\index{GetInNeighbor@{GetInNeighbor}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ const sd\-Vertex$<$ WT $>$ \& sd\-Vertex$<$ WT $>$::Get\-In\-Neighbor (int {\em i}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a18}




Definition at line 190 of file sdvertex.inc.

Referenced by operator()().\footnotesize\begin{verbatim}00191   { return *(InE[i].V); }
00192 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetInWeight@{GetInWeight}}
\index{GetInWeight@{GetInWeight}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ WT \& sd\-Vertex$<$ WT $>$::Get\-In\-Weight (int {\em i})\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a35}




Definition at line 276 of file sdvertex.inc.\footnotesize\begin{verbatim}00277   { return InE[i].W; }
00278 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetInWeight@{GetInWeight}}
\index{GetInWeight@{GetInWeight}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ const WT \& sd\-Vertex$<$ WT $>$::Get\-In\-Weight (int {\em i}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a34}




Definition at line 272 of file sdvertex.inc.

Referenced by sd\-Graph::Get\-Weight().\footnotesize\begin{verbatim}00273   { return InE[i].W; }
00274 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetOutEdge@{GetOutEdge}}
\index{GetOutEdge@{GetOutEdge}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ {\bf sd\-Edge}$<$ WT $>$ \& sd\-Vertex$<$ WT $>$::Get\-Out\-Edge (int {\em i})\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a29}




Definition at line 252 of file sdvertex.inc.\footnotesize\begin{verbatim}00253   { return OutE[i]; }
00254 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetOutEdge@{GetOutEdge}}
\index{GetOutEdge@{GetOutEdge}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ const {\bf sd\-Edge}$<$ WT $>$ \& sd\-Vertex$<$ WT $>$::Get\-Out\-Edge (int {\em i}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a28}




Definition at line 248 of file sdvertex.inc.\footnotesize\begin{verbatim}00249   { return OutE[i]; }
00250 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetOutEdgeIndex@{GetOutEdgeIndex}}
\index{GetOutEdgeIndex@{GetOutEdgeIndex}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ int sd\-Vertex$<$ WT $>$::Get\-Out\-Edge\-Index (int {\em to\_\-id}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a23}




Definition at line 206 of file sdvertex.inc.\footnotesize\begin{verbatim}00207   {
00208     if(!NumO) return -1;
00209 
00210     sdEdge<WT> edge; edge.V = new sdVertex<WT>(to_id, 0, 0);
00211     int index = BinSearch(OutE, NumO, edge);
00212     delete edge.V;
00213     return index;
00214 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetOutEdgeIndex@{GetOutEdgeIndex}}
\index{GetOutEdgeIndex@{GetOutEdgeIndex}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ int sd\-Vertex$<$ WT $>$::Get\-Out\-Edge\-Index (const sd\-Vertex$<$ WT $>$ \& {\em to}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a22}




Definition at line 217 of file sdvertex.inc.

Referenced by Has\-Edge\-To().\footnotesize\begin{verbatim}00218   { return GetOutEdgeIndex(to.ID); }
00219 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetOutNeighbor@{GetOutNeighbor}}
\index{GetOutNeighbor@{GetOutNeighbor}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ sd\-Vertex$<$ WT $>$ \& sd\-Vertex$<$ WT $>$::Get\-Out\-Neighbor (int {\em i})\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a15}




Definition at line 178 of file sdvertex.inc.\footnotesize\begin{verbatim}00179   { return *(OutE[i].V); }
00180 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetOutNeighbor@{GetOutNeighbor}}
\index{GetOutNeighbor@{GetOutNeighbor}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ const sd\-Vertex$<$ WT $>$ \& sd\-Vertex$<$ WT $>$::Get\-Out\-Neighbor (int {\em i}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a14}




Definition at line 174 of file sdvertex.inc.

Referenced by operator[$\,$]().\footnotesize\begin{verbatim}00175   { return *(OutE[i].V); }
00176 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetOutWeight@{GetOutWeight}}
\index{GetOutWeight@{GetOutWeight}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ WT \& sd\-Vertex$<$ WT $>$::Get\-Out\-Weight (int {\em i})\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a33}




Definition at line 268 of file sdvertex.inc.\footnotesize\begin{verbatim}00269   { return OutE[i].W; }
00270 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!GetOutWeight@{GetOutWeight}}
\index{GetOutWeight@{GetOutWeight}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ const WT \& sd\-Vertex$<$ WT $>$::Get\-Out\-Weight (int {\em i}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a32}




Definition at line 264 of file sdvertex.inc.

Referenced by sd\-Graph::Get\-Weight().\footnotesize\begin{verbatim}00265   { return OutE[i].W; }
00266 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!HasEdgeFrom@{HasEdgeFrom}}
\index{HasEdgeFrom@{HasEdgeFrom}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ int sd\-Vertex$<$ WT $>$::Has\-Edge\-From (const sd\-Vertex$<$ WT $>$ \& {\em from}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a27}




Definition at line 240 of file sdvertex.inc.

Referenced by Connected().\footnotesize\begin{verbatim}00241   { return (GetInEdgeIndex(from.ID) != -1); }
00242 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!HasEdgeTo@{HasEdgeTo}}
\index{HasEdgeTo@{HasEdgeTo}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ int sd\-Vertex$<$ WT $>$::Has\-Edge\-To (const sd\-Vertex$<$ WT $>$ \& {\em to}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a26}




Definition at line 236 of file sdvertex.inc.

Referenced by Connected(), and sd\-Graph::Has\-Edge().\footnotesize\begin{verbatim}00237   { return (GetOutEdgeIndex(to.ID) != -1); }
00238 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!InDegree@{InDegree}}
\index{InDegree@{InDegree}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ int sd\-Vertex$<$ WT $>$::In\-Degree () const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a5}




Definition at line 89 of file sdvertex.inc.

Referenced by Degree().\footnotesize\begin{verbatim}00090   { return NumI; }
00091 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!MAKECOMPARISONS_WITH_COMPARE@{MAKECOMPARISONS\_\-WITH\_\-COMPARE}}
\index{MAKECOMPARISONS_WITH_COMPARE@{MAKECOMPARISONS\_\-WITH\_\-COMPARE}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT = double$>$ sd\-Vertex$<$WT$>$::MAKECOMPARISONS\_\-WITH\_\-COMPARE (sd\-Vertex$<$ WT $>$)}\label{class_sdVertex_a13}


\index{sdVertex@{sd\-Vertex}!OutDegree@{OutDegree}}
\index{OutDegree@{OutDegree}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ int sd\-Vertex$<$ WT $>$::Out\-Degree () const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a4}




Definition at line 85 of file sdvertex.inc.

Referenced by Degree().\footnotesize\begin{verbatim}00086   { return NumO; }
00087 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!PrintEdges@{PrintEdges}}
\index{PrintEdges@{PrintEdges}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ void sd\-Vertex$<$ WT $>$::Print\-Edges (ostream \& {\em os}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a10}




Definition at line 118 of file sdvertex.inc.\footnotesize\begin{verbatim}00119   { PrintOutEdges(os); PrintInEdges(os); }
00120 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!PrintInEdges@{PrintInEdges}}
\index{PrintInEdges@{PrintInEdges}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ void sd\-Vertex$<$ WT $>$::Print\-In\-Edges (ostream \& {\em os}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a9}




Definition at line 111 of file sdvertex.inc.

Referenced by Print\-Edges().\footnotesize\begin{verbatim}00112   {
00113     for(int i=0; i<NumI; ++i)
00114         os << '\t' << InE[i].V->ID << '\t' << ID << '\t' << InE[i].W << '\n';
00115 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!PrintOutEdges@{PrintOutEdges}}
\index{PrintOutEdges@{PrintOutEdges}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ void sd\-Vertex$<$ WT $>$::Print\-Out\-Edges (ostream \& {\em os}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a8}




Definition at line 104 of file sdvertex.inc.

Referenced by sd\-Graph::Output(), and Print\-Edges().\footnotesize\begin{verbatim}00105   {
00106     for(int i=0; i<NumO; ++i)
00107         os << '\t' << ID << '\t' << OutE[i].V->ID << '\t' << OutE[i].W << '\n';
00108 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!SortEdges@{SortEdges}}
\index{SortEdges@{SortEdges}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ void sd\-Vertex$<$ WT $>$::Sort\-Edges ()\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a7}




Definition at line 97 of file sdvertex.inc.

Referenced by sd\-Graph::Copy().\footnotesize\begin{verbatim}00098   {
00099     QuickSort(OutE, NumO);
00100     QuickSort(InE, NumI);
00101 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!operator()@{operator()}}
\index{operator()@{operator()}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ sd\-Vertex$<$ WT $>$ \& sd\-Vertex$<$ WT $>$::operator() (int {\em i})\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a21}




Definition at line 202 of file sdvertex.inc.\footnotesize\begin{verbatim}00203   { return GetInNeighbor(i); }
00204 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!operator()@{operator()}}
\index{operator()@{operator()}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ const sd\-Vertex$<$ WT $>$ \& sd\-Vertex$<$ WT $>$::operator() (int {\em i}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a20}




Definition at line 198 of file sdvertex.inc.\footnotesize\begin{verbatim}00199   { return GetInNeighbor(i); }
00200 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!operator=@{operator=}}
\index{operator=@{operator=}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ const sd\-Vertex$<$ WT $>$ \& sd\-Vertex$<$ WT $>$::operator= (const sd\-Vertex$<$ WT $>$ \& {\em sdv})\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a11}




Definition at line 126 of file sdvertex.inc.\footnotesize\begin{verbatim}00127   {
00128     sdEdge<WT> * OutE_tmp = OutE, * InE_tmp = InE;
00129 
00130     if(this != &sdv)
00131       {
00132         if(sdv.NumO<1)
00133             OutE = 0;
00134         else if(!(OutE = new sdEdge<WT>[sdv.NumO]))
00135           {
00136             OutE = OutE_tmp;
00137             return *this;
00138           }
00139         if(sdv.NumI<1)
00140             InE = 0;
00141         else if(!(InE  = new sdEdge<WT>[sdv.NumI]))
00142           {
00143             delete[] OutE;
00144             OutE = OutE_tmp;
00145             InE  = InE_tmp;
00146             return *this;
00147           }
00148         delete[] OutE_tmp;
00149         delete[] InE_tmp;
00150 
00151         ID   = sdv.ID;
00152         NumO = sdv.NumO;
00153         NumI = sdv.NumI;
00154 
00155         for(int i=0; i<NumO; ++i)
00156           {
00157             OutE[i].V = sdv.OutE[i].V;
00158             OutE[i].W = sdv.OutE[i].W;
00159           }
00160         for(int i=0; i<NumI; ++i)
00161           {
00162             InE[i].V = sdv.InE[i].V;
00163             InE[i].W = sdv.InE[i].W;
00164           }
00165       }
00166 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!operator[]@{operator[]}}
\index{operator[]@{operator[]}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ sd\-Vertex$<$ WT $>$ \& sd\-Vertex$<$ WT $>$::operator[$\,$] (int {\em i})\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a17}




Definition at line 186 of file sdvertex.inc.\footnotesize\begin{verbatim}00187   { return GetOutNeighbor(i); }
00188 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!operator[]@{operator[]}}
\index{operator[]@{operator[]}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT$>$ const sd\-Vertex$<$ WT $>$ \& sd\-Vertex$<$ WT $>$::operator[$\,$] (int {\em i}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_sdVertex_a16}




Definition at line 182 of file sdvertex.inc.\footnotesize\begin{verbatim}00183   { return GetOutNeighbor(i); }
00184 \end{verbatim}\normalsize 


\subsection{Friends And Related Function Documentation}
\index{sdVertex@{sd\-Vertex}!Connected@{Connected}}
\index{Connected@{Connected}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT = double$>$ int Connected (const sd\-Vertex$<$ WT $>$ \& {\em v1}, const sd\-Vertex$<$ WT $>$ \& {\em v2})\hspace{0.3cm}{\tt  [friend]}}\label{class_sdVertex_l1}




Definition at line 244 of file sdvertex.inc.\footnotesize\begin{verbatim}00245   { return (v1.HasEdgeTo(v2) || v1.HasEdgeFrom(v2)); }
00246 \end{verbatim}\normalsize 
\index{sdVertex@{sd\-Vertex}!operator@{operator}}
\index{operator@{operator}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT = double$>$ ostream\& operator (ostream \& {\em os}, const sd\-Vertex$<$ WT $>$ \& {\em vert})\hspace{0.3cm}{\tt  [friend]}}\label{class_sdVertex_l0}




\subsection{Member Data Documentation}
\index{sdVertex@{sd\-Vertex}!ID@{ID}}
\index{ID@{ID}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT = double$>$ int sd\-Vertex$<$WT$>$::ID}\label{class_sdVertex_m0}




Definition at line 52 of file sdvertex.h.\index{sdVertex@{sd\-Vertex}!InE@{InE}}
\index{InE@{InE}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT = double$>$ {\bf sd\-Edge}$<$ WT $>$ $\ast$ sd\-Vertex$<$WT$>$::In\-E}\label{class_sdVertex_m4}




Definition at line 60 of file sdvertex.h.\index{sdVertex@{sd\-Vertex}!NumI@{NumI}}
\index{NumI@{NumI}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT = double$>$ int sd\-Vertex$<$WT$>$::Num\-I}\label{class_sdVertex_m2}




Definition at line 56 of file sdvertex.h.\index{sdVertex@{sd\-Vertex}!NumO@{NumO}}
\index{NumO@{NumO}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT = double$>$ int sd\-Vertex$<$WT$>$::Num\-O}\label{class_sdVertex_m1}




Definition at line 55 of file sdvertex.h.\index{sdVertex@{sd\-Vertex}!OutE@{OutE}}
\index{OutE@{OutE}!sdVertex@{sd\-Vertex}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class WT = double$>$ {\bf sd\-Edge}$<$ WT $>$ $\ast$ sd\-Vertex$<$WT$>$::Out\-E}\label{class_sdVertex_m3}




Definition at line 59 of file sdvertex.h.

The documentation for this class was generated from the following files:\begin{CompactItemize}
\item 
{\bf sdvertex.h}\item 
{\bf sdvertex.inc}\end{CompactItemize}
