\section{Dijkstra\-Vectors::lt\-Set\-Element Struct Reference}
\label{struct_dijkstra_vectors_1_1lt_set_element}\index{DijkstraVectors::ltSetElement@{DijkstraVectors::ltSetElement}}
strict weak ordering on Set\-Element's.  


\subsection*{Public Member Functions}
\begin{CompactItemize}
\item 
bool {\bf operator()} (const {\bf Set\-Element} $\ast$s1, const {\bf Set\-Element} $\ast$s2) const 
\end{CompactItemize}


\subsection{Detailed Description}
strict weak ordering on Set\-Element's. 



\subsection{Member Function Documentation}
\index{DijkstraVectors::ltSetElement@{Dijkstra\-Vectors::lt\-Set\-Element}!operator()@{operator()}}
\index{operator()@{operator()}!DijkstraVectors::ltSetElement@{Dijkstra\-Vectors::lt\-Set\-Element}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}bool Dijkstra\-Vectors::lt\-Set\-Element::operator() (const {\bf Set\-Element} $\ast$ {\em s1}, const {\bf Set\-Element} $\ast$ {\em s2}) const}\label{struct_dijkstra_vectors_1_1lt_set_element_13ab10bb51738bae70e831b0dbae5e96}


implements the strict weak ordering on Set\-Element's. \begin{Desc}
\item[Returns:]true if the first precedes the second; false otherwise. \end{Desc}


The documentation for this struct was generated from the following file:\begin{CompactItemize}
\item 
{\bf Dijkstra\-Vectors.h}\end{CompactItemize}
