\hypertarget{a00303}{
\section{mln::p\_\-edges$<$ G, F $>$ Class Template Reference}
\label{dc/d0f/a00303}\index{mln::p\_\-edges@{mln::p\_\-edges}}
}


\hyperlink{a00343}{Site} set mapping graph edges and image sites.  




{\ttfamily \#include $<$p\_\-edges.hh$>$}



Inherits site\_\-set\_\-base\_\-$<$ F::result, p\_\-edges$<$ G, F $>$ $>$.

\subsection*{Public Types}
\begin{DoxyCompactItemize}
\item 
typedef \hyperlink{a00394}{util::edge}$<$ G $>$ \hyperlink{a00303_a3e243c79e43587957ab1118331c27f7c}{edge}
\begin{DoxyCompactList}\small\item\em Type of graph edge. \item\end{DoxyCompactList}\item 
typedef F \hyperlink{a00303_ab69c33fffc6332d61dcd0df8fb98f214}{fun\_\-t}
\begin{DoxyCompactList}\small\item\em \hyperlink{a00031}{Function} associated type. \item\end{DoxyCompactList}\item 
typedef \hyperlink{a00394}{util::edge}$<$ G $>$ \hyperlink{a00303_a91a1da70355b7938908dbb4868b4602c}{graph\_\-element}
\begin{DoxyCompactList}\small\item\em Type of graph element this site set focuses on. \item\end{DoxyCompactList}\item 
typedef G \hyperlink{a00303_aa6e0f41d74552698d59780ba86fcfe3f}{graph\_\-t}
\begin{DoxyCompactList}\small\item\em \hyperlink{a00040}{Graph} associated type. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\begin{Indent}{\bf }\par
{\em \label{_amgrpd41d8cd98f00b204e9800998ecf8427e}
 }\begin{DoxyCompactItemize}
\item 
typedef super\_\-::site \hyperlink{a00303_a7f1486ddbbbd123bab01447ecc07c92a}{element}
\begin{DoxyCompactList}\small\item\em Associated types. \item\end{DoxyCompactList}\item 
typedef p\_\-edges\_\-psite$<$ G, F $>$ \hyperlink{a00303_a00904a7d19d9a9f1964850881bb8e5d8}{psite}
\begin{DoxyCompactList}\small\item\em \hyperlink{a00331}{Point\_\-Site} associated type. \item\end{DoxyCompactList}\item 
typedef \hyperlink{a00305}{p\_\-graph\_\-piter}$<$ \hyperlink{a00303}{self\_\-}, mln\_\-edge\_\-fwd\_\-iter(G) $>$ \hyperlink{a00303_a22040911675cde25c59daeab65e97a6b}{fwd\_\-piter}
\begin{DoxyCompactList}\small\item\em Forward \hyperlink{a00345}{Site\_\-Iterator} associated type. \item\end{DoxyCompactList}\item 
typedef \hyperlink{a00305}{p\_\-graph\_\-piter}$<$ \hyperlink{a00303}{self\_\-}, mln\_\-edge\_\-bkd\_\-iter(G) $>$ \hyperlink{a00303_a1ffb7de7bb2c9e2011d30b7d58227c16}{bkd\_\-piter}
\begin{DoxyCompactList}\small\item\em Backward \hyperlink{a00345}{Site\_\-Iterator} associated type. \item\end{DoxyCompactList}\item 
typedef \hyperlink{a00305}{fwd\_\-piter} \hyperlink{a00303_a8b02e511f3b8a9e4ab02d6a24715c86b}{piter}
\begin{DoxyCompactList}\small\item\em \hyperlink{a00345}{Site\_\-Iterator} associated type. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\end{Indent}
\subsection*{Public Member Functions}
\begin{DoxyCompactItemize}
\item 
bool \hyperlink{a00303_ae19279255582ddc7e3b10c584d899701}{has} (const \hyperlink{a00303_a00904a7d19d9a9f1964850881bb8e5d8}{psite} \&p) const 
\begin{DoxyCompactList}\small\item\em Does this site set has site {\itshape p\/}? \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename G2 $>$ }\\bool \hyperlink{a00303_a7e9b716c84f0434a7b59ff962ea87c45}{has} (const \hyperlink{a00394}{util::edge}$<$ G2 $>$ \&e) const 
\begin{DoxyCompactList}\small\item\em Does this site set has edge {\itshape e\/}? \item\end{DoxyCompactList}\item 
void \hyperlink{a00303_a1c9b151e8d90359897ba3ab270eb12d8}{invalidate} ()
\begin{DoxyCompactList}\small\item\em Invalidate this site set. \item\end{DoxyCompactList}\item 
bool \hyperlink{a00303_ac1c55dd8fe87ae1d9df8b8af4f056dc2}{is\_\-valid} () const 
\begin{DoxyCompactList}\small\item\em Is this site set valid? \item\end{DoxyCompactList}\item 
std::size\_\-t \hyperlink{a00303_a81fe3b5dae767a48d4be06424f758561}{memory\_\-size} () const 
\begin{DoxyCompactList}\small\item\em Does this site set has {\itshape vertex\_\-id\/}? FIXME: causes ambiguities while calling has(mln::neighb\_\-fwd\_\-niter$<$$>$); bool has(unsigned vertex\_\-id) const;. \item\end{DoxyCompactList}\item 
unsigned \hyperlink{a00303_a291e70d577e896993ac2bbb1c43eb5f8}{nedges} () const 
\begin{DoxyCompactList}\small\item\em Return The number of edges in the graph. \item\end{DoxyCompactList}\item 
unsigned \hyperlink{a00303_a20fd2e37d050e17fe3228aab67913a9a}{nsites} () const 
\begin{DoxyCompactList}\small\item\em Return The number of points (sites) of the set, i.e., the number of {\itshape edges\/}. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\begin{Indent}{\bf }\par
{\em \label{_amgrpd41d8cd98f00b204e9800998ecf8427e}
 }\begin{DoxyCompactItemize}
\item 
\hyperlink{a00303_aa3bdb4ff1d26654b3d35cc7eda328b54}{p\_\-edges} ()
\begin{DoxyCompactList}\small\item\em Constructors

Default constructor. \item\end{DoxyCompactList}\item 
\hyperlink{a00303_a4ec2845d77a5bdc255bca8f85d34f9de}{p\_\-edges} (const \hyperlink{a00040}{Graph}$<$ G $>$ \&gr)
\begin{DoxyCompactList}\small\item\em Construct a graph edge psite set from a graph. \item\end{DoxyCompactList}\item 
\hyperlink{a00303_a2e944095dc478dee3d4ca24b4a41a1ca}{p\_\-edges} (const \hyperlink{a00040}{Graph}$<$ G $>$ \&gr, const \hyperlink{a00031}{Function}$<$ F $>$ \&f)
\begin{DoxyCompactList}\small\item\em Construct a graph edge psite set from a graph and a function. \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename F2 $>$ }\\\hyperlink{a00303_a0d7072f62281caea460f9fc080a850db}{p\_\-edges} (const \hyperlink{a00040}{Graph}$<$ G $>$ \&gr, const \hyperlink{a00031}{Function}$<$ F2 $>$ \&f)
\begin{DoxyCompactList}\small\item\em Construct a graph edge psite set from a graph and a function. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\end{Indent}
\begin{Indent}{\bf }\par
{\em \label{_amgrpd41d8cd98f00b204e9800998ecf8427e}
 }\begin{DoxyCompactItemize}
\item 
const G \& \hyperlink{a00303_a4d7ddca88aaa0cae3d01e874c9f078a1}{graph} () const 
\begin{DoxyCompactList}\small\item\em Accessors. \item\end{DoxyCompactList}\item 
const F \& \hyperlink{a00303_a6691aed543e6d9bf2b2490c2e27d1ff3}{function} () const 
\begin{DoxyCompactList}\small\item\em Return the mapping function. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\end{Indent}


\subsection{Detailed Description}
\subsubsection*{template$<$typename G, typename F = util::internal::id2element$<$G,util::edge$<$G$>$ $>$$>$ class mln::p\_\-edges$<$ G, F $>$}

\hyperlink{a00343}{Site} set mapping graph edges and image sites. 

Definition at line 70 of file p\_\-edges.hh.



\subsection{Member Typedef Documentation}
\hypertarget{a00303_a1ffb7de7bb2c9e2011d30b7d58227c16}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!bkd\_\-piter@{bkd\_\-piter}}
\index{bkd\_\-piter@{bkd\_\-piter}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{bkd\_\-piter}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G, typename F = util::internal::id2element$<$G,util::edge$<$G$>$ $>$$>$ typedef {\bf p\_\-graph\_\-piter}$<$ {\bf self\_\-}, mln\_\-edge\_\-bkd\_\-iter(G) $>$ {\bf mln::p\_\-edges}$<$ G, F $>$::{\bf bkd\_\-piter}}}
\label{dc/d0f/a00303_a1ffb7de7bb2c9e2011d30b7d58227c16}


Backward \hyperlink{a00345}{Site\_\-Iterator} associated type. 



Definition at line 128 of file p\_\-edges.hh.

\hypertarget{a00303_a3e243c79e43587957ab1118331c27f7c}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!edge@{edge}}
\index{edge@{edge}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{edge}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G, typename F = util::internal::id2element$<$G,util::edge$<$G$>$ $>$$>$ typedef {\bf util::edge}$<$G$>$ {\bf mln::p\_\-edges}$<$ G, F $>$::{\bf edge}}}
\label{dc/d0f/a00303_a3e243c79e43587957ab1118331c27f7c}


Type of graph edge. 



Definition at line 86 of file p\_\-edges.hh.

\hypertarget{a00303_a7f1486ddbbbd123bab01447ecc07c92a}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!element@{element}}
\index{element@{element}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{element}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G, typename F = util::internal::id2element$<$G,util::edge$<$G$>$ $>$$>$ typedef super\_\- ::site {\bf mln::p\_\-edges}$<$ G, F $>$::{\bf element}}}
\label{dc/d0f/a00303_a7f1486ddbbbd123bab01447ecc07c92a}


Associated types. 

Element associated type. 

Definition at line 119 of file p\_\-edges.hh.

\hypertarget{a00303_ab69c33fffc6332d61dcd0df8fb98f214}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!fun\_\-t@{fun\_\-t}}
\index{fun\_\-t@{fun\_\-t}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{fun\_\-t}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G, typename F = util::internal::id2element$<$G,util::edge$<$G$>$ $>$$>$ typedef F {\bf mln::p\_\-edges}$<$ G, F $>$::{\bf fun\_\-t}}}
\label{dc/d0f/a00303_ab69c33fffc6332d61dcd0df8fb98f214}


\hyperlink{a00031}{Function} associated type. 



Definition at line 83 of file p\_\-edges.hh.

\hypertarget{a00303_a22040911675cde25c59daeab65e97a6b}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!fwd\_\-piter@{fwd\_\-piter}}
\index{fwd\_\-piter@{fwd\_\-piter}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{fwd\_\-piter}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G, typename F = util::internal::id2element$<$G,util::edge$<$G$>$ $>$$>$ typedef {\bf p\_\-graph\_\-piter}$<$ {\bf self\_\-}, mln\_\-edge\_\-fwd\_\-iter(G) $>$ {\bf mln::p\_\-edges}$<$ G, F $>$::{\bf fwd\_\-piter}}}
\label{dc/d0f/a00303_a22040911675cde25c59daeab65e97a6b}


Forward \hyperlink{a00345}{Site\_\-Iterator} associated type. 



Definition at line 125 of file p\_\-edges.hh.

\hypertarget{a00303_a91a1da70355b7938908dbb4868b4602c}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!graph\_\-element@{graph\_\-element}}
\index{graph\_\-element@{graph\_\-element}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{graph\_\-element}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G, typename F = util::internal::id2element$<$G,util::edge$<$G$>$ $>$$>$ typedef {\bf util::edge}$<$G$>$ {\bf mln::p\_\-edges}$<$ G, F $>$::{\bf graph\_\-element}}}
\label{dc/d0f/a00303_a91a1da70355b7938908dbb4868b4602c}


Type of graph element this site set focuses on. 



Definition at line 89 of file p\_\-edges.hh.

\hypertarget{a00303_aa6e0f41d74552698d59780ba86fcfe3f}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!graph\_\-t@{graph\_\-t}}
\index{graph\_\-t@{graph\_\-t}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{graph\_\-t}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G, typename F = util::internal::id2element$<$G,util::edge$<$G$>$ $>$$>$ typedef G {\bf mln::p\_\-edges}$<$ G, F $>$::{\bf graph\_\-t}}}
\label{dc/d0f/a00303_aa6e0f41d74552698d59780ba86fcfe3f}


\hyperlink{a00040}{Graph} associated type. 



Definition at line 80 of file p\_\-edges.hh.

\hypertarget{a00303_a8b02e511f3b8a9e4ab02d6a24715c86b}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!piter@{piter}}
\index{piter@{piter}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{piter}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G, typename F = util::internal::id2element$<$G,util::edge$<$G$>$ $>$$>$ typedef {\bf fwd\_\-piter} {\bf mln::p\_\-edges}$<$ G, F $>$::{\bf piter}}}
\label{dc/d0f/a00303_a8b02e511f3b8a9e4ab02d6a24715c86b}


\hyperlink{a00345}{Site\_\-Iterator} associated type. 



Definition at line 131 of file p\_\-edges.hh.

\hypertarget{a00303_a00904a7d19d9a9f1964850881bb8e5d8}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!psite@{psite}}
\index{psite@{psite}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{psite}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G, typename F = util::internal::id2element$<$G,util::edge$<$G$>$ $>$$>$ typedef p\_\-edges\_\-psite$<$G, F$>$ {\bf mln::p\_\-edges}$<$ G, F $>$::{\bf psite}}}
\label{dc/d0f/a00303_a00904a7d19d9a9f1964850881bb8e5d8}


\hyperlink{a00331}{Point\_\-Site} associated type. 



Definition at line 122 of file p\_\-edges.hh.



\subsection{Constructor \& Destructor Documentation}
\hypertarget{a00303_aa3bdb4ff1d26654b3d35cc7eda328b54}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!p\_\-edges@{p\_\-edges}}
\index{p\_\-edges@{p\_\-edges}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{p\_\-edges}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G , typename F $>$ {\bf mln::p\_\-edges}$<$ G, F $>$::{\bf p\_\-edges} (
\begin{DoxyParamCaption}
{}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d0f/a00303_aa3bdb4ff1d26654b3d35cc7eda328b54}


Constructors

Default constructor. 



Definition at line 203 of file p\_\-edges.hh.

\hypertarget{a00303_a4ec2845d77a5bdc255bca8f85d34f9de}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!p\_\-edges@{p\_\-edges}}
\index{p\_\-edges@{p\_\-edges}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{p\_\-edges}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G , typename F $>$ {\bf mln::p\_\-edges}$<$ G, F $>$::{\bf p\_\-edges} (
\begin{DoxyParamCaption}
\item[{const {\bf Graph}$<$ G $>$ \&}]{ gr}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d0f/a00303_a4ec2845d77a5bdc255bca8f85d34f9de}


Construct a graph edge psite set from a graph. 


\begin{DoxyParams}{Parameters}
\item[{\em gr}]The graph upon which the graph edge psite set is built. \end{DoxyParams}


Definition at line 209 of file p\_\-edges.hh.



References mln::p\_\-edges$<$ G, F $>$::is\_\-valid().

\hypertarget{a00303_a2e944095dc478dee3d4ca24b4a41a1ca}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!p\_\-edges@{p\_\-edges}}
\index{p\_\-edges@{p\_\-edges}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{p\_\-edges}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G , typename F $>$ {\bf mln::p\_\-edges}$<$ G, F $>$::{\bf p\_\-edges} (
\begin{DoxyParamCaption}
\item[{const {\bf Graph}$<$ G $>$ \&}]{ gr, }
\item[{const {\bf Function}$<$ F $>$ \&}]{ f}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d0f/a00303_a2e944095dc478dee3d4ca24b4a41a1ca}


Construct a graph edge psite set from a graph and a function. 


\begin{DoxyParams}{Parameters}
\item[{\em gr}]The graph upon which the graph edge psite set is built. \item[{\em f}]the function mapping edges and sites. \end{DoxyParams}


Definition at line 221 of file p\_\-edges.hh.



References mln::p\_\-edges$<$ G, F $>$::is\_\-valid().

\hypertarget{a00303_a0d7072f62281caea460f9fc080a850db}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!p\_\-edges@{p\_\-edges}}
\index{p\_\-edges@{p\_\-edges}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{p\_\-edges}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G , typename F $>$ template$<$typename F2 $>$ {\bf mln::p\_\-edges}$<$ G, F $>$::{\bf p\_\-edges} (
\begin{DoxyParamCaption}
\item[{const {\bf Graph}$<$ G $>$ \&}]{ gr, }
\item[{const {\bf Function}$<$ F2 $>$ \&}]{ f}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d0f/a00303_a0d7072f62281caea460f9fc080a850db}


Construct a graph edge psite set from a graph and a function. 


\begin{DoxyParams}{Parameters}
\item[{\em gr}]The graph upon which the graph edge psite set is built. \item[{\em f}]the function mapping edges and sites. It must be convertible towards the function type {\ttfamily F}. \end{DoxyParams}


Definition at line 231 of file p\_\-edges.hh.



References mln::p\_\-edges$<$ G, F $>$::is\_\-valid().



\subsection{Member Function Documentation}
\hypertarget{a00303_a6691aed543e6d9bf2b2490c2e27d1ff3}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!function@{function}}
\index{function@{function}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{function}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G , typename F $>$ const F \& {\bf mln::p\_\-edges}$<$ G, F $>$::function (
\begin{DoxyParamCaption}
{}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d0f/a00303_a6691aed543e6d9bf2b2490c2e27d1ff3}


Return the mapping function. 



Definition at line 324 of file p\_\-edges.hh.

\hypertarget{a00303_a4d7ddca88aaa0cae3d01e874c9f078a1}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!graph@{graph}}
\index{graph@{graph}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{graph}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G , typename F $>$ const G \& {\bf mln::p\_\-edges}$<$ G, F $>$::graph (
\begin{DoxyParamCaption}
{}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d0f/a00303_a4d7ddca88aaa0cae3d01e874c9f078a1}


Accessors. 

Return the graph associated to this site set 

Definition at line 315 of file p\_\-edges.hh.



References mln::p\_\-edges$<$ G, F $>$::is\_\-valid().



Referenced by mln::operator==().

\hypertarget{a00303_ae19279255582ddc7e3b10c584d899701}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!has@{has}}
\index{has@{has}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{has}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G , typename F $>$ bool {\bf mln::p\_\-edges}$<$ G, F $>$::has (
\begin{DoxyParamCaption}
\item[{const {\bf psite} \&}]{ p}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d0f/a00303_ae19279255582ddc7e3b10c584d899701}


Does this site set has site {\itshape p\/}? 



Definition at line 276 of file p\_\-edges.hh.



References mln::p\_\-edges$<$ G, F $>$::is\_\-valid().

\hypertarget{a00303_a7e9b716c84f0434a7b59ff962ea87c45}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!has@{has}}
\index{has@{has}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{has}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G , typename F $>$ template$<$typename G2 $>$ bool {\bf mln::p\_\-edges}$<$ G, F $>$::has (
\begin{DoxyParamCaption}
\item[{const {\bf util::edge}$<$ G2 $>$ \&}]{ e}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d0f/a00303_a7e9b716c84f0434a7b59ff962ea87c45}


Does this site set has edge {\itshape e\/}? 



Definition at line 286 of file p\_\-edges.hh.



References mln::util::edge$<$ G $>$::graph(), mln::util::edge$<$ G $>$::is\_\-valid(), and mln::p\_\-edges$<$ G, F $>$::is\_\-valid().

\hypertarget{a00303_a1c9b151e8d90359897ba3ab270eb12d8}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!invalidate@{invalidate}}
\index{invalidate@{invalidate}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{invalidate}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G , typename F $>$ void {\bf mln::p\_\-edges}$<$ G, F $>$::invalidate (
\begin{DoxyParamCaption}
{}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d0f/a00303_a1c9b151e8d90359897ba3ab270eb12d8}


Invalidate this site set. 



Definition at line 268 of file p\_\-edges.hh.

\hypertarget{a00303_ac1c55dd8fe87ae1d9df8b8af4f056dc2}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!is\_\-valid@{is\_\-valid}}
\index{is\_\-valid@{is\_\-valid}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{is\_\-valid}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G , typename F $>$ bool {\bf mln::p\_\-edges}$<$ G, F $>$::is\_\-valid (
\begin{DoxyParamCaption}
{}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d0f/a00303_ac1c55dd8fe87ae1d9df8b8af4f056dc2}


Is this site set valid? 



Definition at line 260 of file p\_\-edges.hh.



Referenced by mln::p\_\-edges$<$ G, F $>$::graph(), mln::p\_\-edges$<$ G, F $>$::has(), and mln::p\_\-edges$<$ G, F $>$::p\_\-edges().

\hypertarget{a00303_a81fe3b5dae767a48d4be06424f758561}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!memory\_\-size@{memory\_\-size}}
\index{memory\_\-size@{memory\_\-size}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{memory\_\-size}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G , typename F $>$ std::size\_\-t {\bf mln::p\_\-edges}$<$ G, F $>$::memory\_\-size (
\begin{DoxyParamCaption}
{}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d0f/a00303_a81fe3b5dae767a48d4be06424f758561}


Does this site set has {\itshape vertex\_\-id\/}? FIXME: causes ambiguities while calling has(mln::neighb\_\-fwd\_\-niter$<$$>$); bool has(unsigned vertex\_\-id) const;. 



Definition at line 305 of file p\_\-edges.hh.

\hypertarget{a00303_a291e70d577e896993ac2bbb1c43eb5f8}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!nedges@{nedges}}
\index{nedges@{nedges}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{nedges}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G , typename F $>$ unsigned {\bf mln::p\_\-edges}$<$ G, F $>$::nedges (
\begin{DoxyParamCaption}
{}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d0f/a00303_a291e70d577e896993ac2bbb1c43eb5f8}


Return The number of edges in the graph. 



Definition at line 252 of file p\_\-edges.hh.



Referenced by mln::p\_\-edges$<$ G, F $>$::nsites().

\hypertarget{a00303_a20fd2e37d050e17fe3228aab67913a9a}{
\index{mln::p\_\-edges@{mln::p\_\-edges}!nsites@{nsites}}
\index{nsites@{nsites}!mln::p_edges@{mln::p\_\-edges}}
\subsubsection[{nsites}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G , typename F $>$ unsigned {\bf mln::p\_\-edges}$<$ G, F $>$::nsites (
\begin{DoxyParamCaption}
{}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d0f/a00303_a20fd2e37d050e17fe3228aab67913a9a}


Return The number of points (sites) of the set, i.e., the number of {\itshape edges\/}. 



Definition at line 244 of file p\_\-edges.hh.



References mln::p\_\-edges$<$ G, F $>$::nedges().

