\hypertarget{a00402}{
\section{mln::util::line\_\-graph$<$ G $>$ Class Template Reference}
\label{d4/d6d/a00402}\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}}
}


Undirected line graph of a graph of type {\ttfamily G}.  




{\ttfamily \#include $<$line\_\-graph.hh$>$}



Inherits graph\_\-base$<$ line\_\-graph$<$ G $>$ $>$.

\subsection*{Public Types}
\begin{DoxyCompactItemize}
\item 
typedef std::vector$<$ edge\_\-data\_\-t $>$ \hyperlink{a00402_ac634f7ecbc8fe7edd05412c42e1c525f}{edges\_\-t}
\begin{DoxyCompactList}\small\item\em The type of the set of edges. \item\end{DoxyCompactList}\item 
typedef std::vector$<$ vertex\_\-data\_\-t $>$ \hyperlink{a00402_a6812e8dfcf7ad487bb9bf27f7e6e8b17}{vertices\_\-t}
\begin{DoxyCompactList}\small\item\em The type of the set of vertices. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\begin{Indent}{\bf }\par
{\em \label{_amgrpd41d8cd98f00b204e9800998ecf8427e}
 }\begin{DoxyCompactItemize}
\item 
typedef mln::internal::vertex\_\-fwd\_\-iterator$<$ \hyperlink{a00402}{line\_\-graph}$<$ G $>$ $>$ \hyperlink{a00402_a70a40d263605df393c6b3e07b1df7e8a}{vertex\_\-fwd\_\-iter}
\begin{DoxyCompactList}\small\item\em \hyperlink{a00046}{Iterator} types

\hyperlink{a00439}{Vertex} iterators. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\end{Indent}
\begin{Indent}{\bf }\par
{\em \label{_amgrpd41d8cd98f00b204e9800998ecf8427e}
 }\begin{DoxyCompactItemize}
\item 
typedef mln::internal::edge\_\-fwd\_\-iterator$<$ \hyperlink{a00402}{line\_\-graph}$<$ G $>$ $>$ \hyperlink{a00402_a44e8e23c1ece4eff9e724a68be9b9086}{edge\_\-fwd\_\-iter}
\begin{DoxyCompactList}\small\item\em \hyperlink{a00183}{Edge} iterators. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\end{Indent}
\begin{Indent}{\bf }\par
{\em \label{_amgrpd41d8cd98f00b204e9800998ecf8427e}
 }\begin{DoxyCompactItemize}
\item 
typedef mln::internal::edge\_\-nbh\_\-edge\_\-fwd\_\-iterator$<$ \hyperlink{a00402}{line\_\-graph}$<$ G $>$ $>$ \hyperlink{a00402_adbbe29144ac5798e0cb5455d7debab5c}{edge\_\-nbh\_\-edge\_\-fwd\_\-iter}
\begin{DoxyCompactList}\small\item\em \hyperlink{a00183}{Edge} nbh edge iterators. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\end{Indent}
\begin{Indent}{\bf }\par
{\em \label{_amgrpd41d8cd98f00b204e9800998ecf8427e}
 }\begin{DoxyCompactItemize}
\item 
typedef mln::internal::vertex\_\-nbh\_\-vertex\_\-fwd\_\-iterator$<$ \hyperlink{a00402}{line\_\-graph}$<$ G $>$ $>$ \hyperlink{a00402_ada77dc9f7adff9c081e730c991d0ea51}{vertex\_\-nbh\_\-vertex\_\-fwd\_\-iter}
\begin{DoxyCompactList}\small\item\em \hyperlink{a00439}{Vertex} nbh vertex iterators. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\end{Indent}
\begin{Indent}{\bf }\par
{\em \label{_amgrpd41d8cd98f00b204e9800998ecf8427e}
 }\begin{DoxyCompactItemize}
\item 
typedef mln::internal::vertex\_\-nbh\_\-edge\_\-fwd\_\-iterator$<$ \hyperlink{a00402}{line\_\-graph}$<$ G $>$ $>$ \hyperlink{a00402_a88dff7dd352c4cc8a15c11a43e7cfe43}{vertex\_\-nbh\_\-edge\_\-fwd\_\-iter}
\begin{DoxyCompactList}\small\item\em \hyperlink{a00439}{Vertex} nbh edge iterators. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\end{Indent}
\subsection*{Public Member Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename G2 $>$ }\\bool \hyperlink{a00402_aa8c27349a24557fb3b15c1940045dda6}{has} (const \hyperlink{a00416}{util::vertex}$<$ G2 $>$ \&v) const 
\begin{DoxyCompactList}\small\item\em Check whether a vertex {\ttfamily v} exists in the line graph. \item\end{DoxyCompactList}\item 
bool \hyperlink{a00402_a235d2bc518f0602bcc93ff4e008cc4e9}{has\_\-v} (const \hyperlink{a00405}{vertex\_\-id\_\-t} \&id\_\-v) const 
\begin{DoxyCompactList}\small\item\em Check whether a vertex id {\ttfamily id\_\-v} exists in the line graph. \item\end{DoxyCompactList}\item 
\hyperlink{a00405}{edge\_\-id\_\-t} \hyperlink{a00402_a38972a451bcb3db97eeb251ff9f98399}{v\_\-ith\_\-nbh\_\-edge} (const \hyperlink{a00405}{vertex\_\-id\_\-t} \&id\_\-v, unsigned i) const 
\begin{DoxyCompactList}\small\item\em Returns the {\ttfamily i} th edge adjacent to the vertex {\ttfamily id\_\-v}. \item\end{DoxyCompactList}\item 
\hyperlink{a00405}{vertex\_\-id\_\-t} \hyperlink{a00402_a3f82f2039054e1b760579c97192ada87}{v\_\-ith\_\-nbh\_\-vertex} (const \hyperlink{a00405}{vertex\_\-id\_\-t} \&id\_\-v, unsigned i) const 
\begin{DoxyCompactList}\small\item\em Returns the {\ttfamily i} th vertex adjacent to the vertex {\ttfamily id\_\-v}. \item\end{DoxyCompactList}\item 
size\_\-t \hyperlink{a00402_a36b9d86e232e6251a94b35c7f8324baa}{v\_\-nmax} () const 
\begin{DoxyCompactList}\small\item\em Return the number of vertices in the graph. \item\end{DoxyCompactList}\item 
size\_\-t \hyperlink{a00402_a548e53b912f3ebf168769713813caa9c}{v\_\-nmax\_\-nbh\_\-edges} (const \hyperlink{a00405}{vertex\_\-id\_\-t} \&id\_\-v) const 
\begin{DoxyCompactList}\small\item\em Return the number of adjacent edges of vertex {\ttfamily id\_\-v}. \item\end{DoxyCompactList}\item 
size\_\-t \hyperlink{a00402_a236216e4f3b061fb8b6485cd770f2f8c}{v\_\-nmax\_\-nbh\_\-vertices} (const \hyperlink{a00405}{vertex\_\-id\_\-t} \&id\_\-v) const 
\begin{DoxyCompactList}\small\item\em Return the number of adjacent vertices of vertex {\ttfamily id\_\-v}. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\begin{Indent}{\bf }\par
{\em \label{_amgrpd41d8cd98f00b204e9800998ecf8427e}
 }\begin{DoxyCompactItemize}
\item 
vertex\_\-t \hyperlink{a00402_a633d89c0b2668c693465303aff8c71ea}{vertex} (const \hyperlink{a00405}{vertex\_\-id\_\-t} \&id\_\-v) const 
\begin{DoxyCompactList}\small\item\em \hyperlink{a00439}{Vertex} oriented. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\end{Indent}
\begin{Indent}{\bf }\par
{\em \label{_amgrpd41d8cd98f00b204e9800998ecf8427e}
 }\begin{DoxyCompactItemize}
\item 
\hyperlink{a00394}{edge\_\-t} \hyperlink{a00402_ab2a90a793518a6c936a235afbb0040b1}{edge} (const \hyperlink{a00405}{edge\_\-id\_\-t} \&e) const 
\begin{DoxyCompactList}\small\item\em \hyperlink{a00183}{Edge} oriented. \item\end{DoxyCompactList}\item 
size\_\-t \hyperlink{a00402_a8d0597a08915b021b99fb3c3c16a1b1c}{e\_\-nmax} () const 
\begin{DoxyCompactList}\small\item\em Return the number of edges in the graph. \item\end{DoxyCompactList}\item 
bool \hyperlink{a00402_afa23cd634fd7debbe957fa738be10df1}{has\_\-e} (const \hyperlink{a00405}{util::edge\_\-id\_\-t} \&id\_\-e) const 
\begin{DoxyCompactList}\small\item\em Return whether {\ttfamily id\_\-e} is in the line graph. \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename G2 $>$ }\\bool \hyperlink{a00402_a246cfd5e2f05b8a37b1d4aa950ae569b}{has} (const \hyperlink{a00394}{util::edge}$<$ G2 $>$ \&e) const 
\begin{DoxyCompactList}\small\item\em Return whether {\ttfamily e} is in the line graph. \item\end{DoxyCompactList}\item 
\hyperlink{a00405}{vertex\_\-id\_\-t} \hyperlink{a00402_a344e74a5839afa5ffa4351960dc9a467}{v1} (const \hyperlink{a00405}{edge\_\-id\_\-t} \&id\_\-e) const 
\begin{DoxyCompactList}\small\item\em Return the first vertex associated to the edge {\ttfamily id\_\-e}. \item\end{DoxyCompactList}\item 
\hyperlink{a00405}{vertex\_\-id\_\-t} \hyperlink{a00402_a6ed302d2464b2a5520a4cf394988b530}{v2} (const \hyperlink{a00405}{edge\_\-id\_\-t} \&id\_\-e) const 
\begin{DoxyCompactList}\small\item\em Return the second vertex associated to edge {\ttfamily id\_\-e}. \item\end{DoxyCompactList}\item 
size\_\-t \hyperlink{a00402_ae60488c32468f1ea266c408f98315157}{e\_\-nmax\_\-nbh\_\-edges} (const \hyperlink{a00405}{edge\_\-id\_\-t} \&id\_\-e) const 
\begin{DoxyCompactList}\small\item\em Return the number max of adjacent edge, given an edge {\ttfamily id\_\-e}. \item\end{DoxyCompactList}\item 
\hyperlink{a00405}{edge\_\-id\_\-t} \hyperlink{a00402_a39fedfd4e8d8f6f2dcaabcbb884e0d9b}{e\_\-ith\_\-nbh\_\-edge} (const \hyperlink{a00405}{edge\_\-id\_\-t} \&id\_\-e, unsigned i) const 
\begin{DoxyCompactList}\small\item\em Return the {\ttfamily i} th edge adjacent to the edge {\ttfamily id\_\-e}. \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename G2 $>$ }\\bool \hyperlink{a00402_abad527eaa75a9267bd5fec6d20e7f84e}{is\_\-subgraph\_\-of} (const G2 \&g) const 
\begin{DoxyCompactList}\small\item\em Return whether this graph is a subgraph Return true if g and $\ast$this have the same graph\_\-id. \item\end{DoxyCompactList}\item 
const G \& \hyperlink{a00402_a1cae272a076b8a5d123ed38c8c0f2fa0}{graph} () const 
\begin{DoxyCompactList}\small\item\em Return the underlying graph. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\end{Indent}


\subsection{Detailed Description}
\subsubsection*{template$<$typename G$>$ class mln::util::line\_\-graph$<$ G $>$}

Undirected line graph of a graph of type {\ttfamily G}. 

Definition at line 82 of file line\_\-graph.hh.



\subsection{Member Typedef Documentation}
\hypertarget{a00402_a44e8e23c1ece4eff9e724a68be9b9086}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!edge\_\-fwd\_\-iter@{edge\_\-fwd\_\-iter}}
\index{edge\_\-fwd\_\-iter@{edge\_\-fwd\_\-iter}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{edge\_\-fwd\_\-iter}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G$>$ typedef mln::internal::edge\_\-fwd\_\-iterator$<$ {\bf line\_\-graph}$<$G$>$ $>$ {\bf mln::util::line\_\-graph}$<$ G $>$::{\bf edge\_\-fwd\_\-iter}}}
\label{d4/d6d/a00402_a44e8e23c1ece4eff9e724a68be9b9086}


\hyperlink{a00183}{Edge} iterators. 



Definition at line 114 of file line\_\-graph.hh.

\hypertarget{a00402_adbbe29144ac5798e0cb5455d7debab5c}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!edge\_\-nbh\_\-edge\_\-fwd\_\-iter@{edge\_\-nbh\_\-edge\_\-fwd\_\-iter}}
\index{edge\_\-nbh\_\-edge\_\-fwd\_\-iter@{edge\_\-nbh\_\-edge\_\-fwd\_\-iter}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{edge\_\-nbh\_\-edge\_\-fwd\_\-iter}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G$>$ typedef mln::internal::edge\_\-nbh\_\-edge\_\-fwd\_\-iterator$<$ {\bf line\_\-graph}$<$G$>$ $>$ {\bf mln::util::line\_\-graph}$<$ G $>$::{\bf edge\_\-nbh\_\-edge\_\-fwd\_\-iter}}}
\label{d4/d6d/a00402_adbbe29144ac5798e0cb5455d7debab5c}


\hyperlink{a00183}{Edge} nbh edge iterators. 



Definition at line 123 of file line\_\-graph.hh.

\hypertarget{a00402_ac634f7ecbc8fe7edd05412c42e1c525f}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!edges\_\-t@{edges\_\-t}}
\index{edges\_\-t@{edges\_\-t}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{edges\_\-t}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G$>$ typedef std::vector$<$edge\_\-data\_\-t$>$ {\bf mln::util::line\_\-graph}$<$ G $>$::{\bf edges\_\-t}}}
\label{d4/d6d/a00402_ac634f7ecbc8fe7edd05412c42e1c525f}


The type of the set of edges. 



Definition at line 98 of file line\_\-graph.hh.

\hypertarget{a00402_a70a40d263605df393c6b3e07b1df7e8a}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!vertex\_\-fwd\_\-iter@{vertex\_\-fwd\_\-iter}}
\index{vertex\_\-fwd\_\-iter@{vertex\_\-fwd\_\-iter}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{vertex\_\-fwd\_\-iter}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G$>$ typedef mln::internal::vertex\_\-fwd\_\-iterator$<$ {\bf line\_\-graph}$<$G$>$ $>$ {\bf mln::util::line\_\-graph}$<$ G $>$::{\bf vertex\_\-fwd\_\-iter}}}
\label{d4/d6d/a00402_a70a40d263605df393c6b3e07b1df7e8a}


\hyperlink{a00046}{Iterator} types

\hyperlink{a00439}{Vertex} iterators. 



Definition at line 105 of file line\_\-graph.hh.

\hypertarget{a00402_a88dff7dd352c4cc8a15c11a43e7cfe43}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!vertex\_\-nbh\_\-edge\_\-fwd\_\-iter@{vertex\_\-nbh\_\-edge\_\-fwd\_\-iter}}
\index{vertex\_\-nbh\_\-edge\_\-fwd\_\-iter@{vertex\_\-nbh\_\-edge\_\-fwd\_\-iter}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{vertex\_\-nbh\_\-edge\_\-fwd\_\-iter}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G$>$ typedef mln::internal::vertex\_\-nbh\_\-edge\_\-fwd\_\-iterator$<$ {\bf line\_\-graph}$<$G$>$ $>$ {\bf mln::util::line\_\-graph}$<$ G $>$::{\bf vertex\_\-nbh\_\-edge\_\-fwd\_\-iter}}}
\label{d4/d6d/a00402_a88dff7dd352c4cc8a15c11a43e7cfe43}


\hyperlink{a00439}{Vertex} nbh edge iterators. 



Definition at line 141 of file line\_\-graph.hh.

\hypertarget{a00402_ada77dc9f7adff9c081e730c991d0ea51}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!vertex\_\-nbh\_\-vertex\_\-fwd\_\-iter@{vertex\_\-nbh\_\-vertex\_\-fwd\_\-iter}}
\index{vertex\_\-nbh\_\-vertex\_\-fwd\_\-iter@{vertex\_\-nbh\_\-vertex\_\-fwd\_\-iter}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{vertex\_\-nbh\_\-vertex\_\-fwd\_\-iter}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G$>$ typedef mln::internal::vertex\_\-nbh\_\-vertex\_\-fwd\_\-iterator$<$ {\bf line\_\-graph}$<$G$>$ $>$ {\bf mln::util::line\_\-graph}$<$ G $>$::{\bf vertex\_\-nbh\_\-vertex\_\-fwd\_\-iter}}}
\label{d4/d6d/a00402_ada77dc9f7adff9c081e730c991d0ea51}


\hyperlink{a00439}{Vertex} nbh vertex iterators. 



Definition at line 132 of file line\_\-graph.hh.

\hypertarget{a00402_a6812e8dfcf7ad487bb9bf27f7e6e8b17}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!vertices\_\-t@{vertices\_\-t}}
\index{vertices\_\-t@{vertices\_\-t}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{vertices\_\-t}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G$>$ typedef std::vector$<$vertex\_\-data\_\-t$>$ {\bf mln::util::line\_\-graph}$<$ G $>$::{\bf vertices\_\-t}}}
\label{d4/d6d/a00402_a6812e8dfcf7ad487bb9bf27f7e6e8b17}


The type of the set of vertices. 



Definition at line 95 of file line\_\-graph.hh.



\subsection{Member Function Documentation}
\hypertarget{a00402_a39fedfd4e8d8f6f2dcaabcbb884e0d9b}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!e\_\-ith\_\-nbh\_\-edge@{e\_\-ith\_\-nbh\_\-edge}}
\index{e\_\-ith\_\-nbh\_\-edge@{e\_\-ith\_\-nbh\_\-edge}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{e\_\-ith\_\-nbh\_\-edge}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ {\bf edge\_\-id\_\-t} {\bf mln::util::line\_\-graph}$<$ G $>$::e\_\-ith\_\-nbh\_\-edge (
\begin{DoxyParamCaption}
\item[{const {\bf edge\_\-id\_\-t} \&}]{ id\_\-e, }
\item[{unsigned}]{ i}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_a39fedfd4e8d8f6f2dcaabcbb884e0d9b}


Return the {\ttfamily i} th edge adjacent to the edge {\ttfamily id\_\-e}. 



Definition at line 460 of file line\_\-graph.hh.



References mln::util::line\_\-graph$<$ G $>$::e\_\-nmax(), mln::util::line\_\-graph$<$ G $>$::e\_\-nmax\_\-nbh\_\-edges(), mln::util::line\_\-graph$<$ G $>$::has\_\-e(), mln::util::line\_\-graph$<$ G $>$::v1(), mln::util::line\_\-graph$<$ G $>$::v2(), mln::util::line\_\-graph$<$ G $>$::v\_\-ith\_\-nbh\_\-edge(), and mln::util::line\_\-graph$<$ G $>$::v\_\-nmax\_\-nbh\_\-edges().

\hypertarget{a00402_a8d0597a08915b021b99fb3c3c16a1b1c}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!e\_\-nmax@{e\_\-nmax}}
\index{e\_\-nmax@{e\_\-nmax}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{e\_\-nmax}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ size\_\-t {\bf mln::util::line\_\-graph}$<$ G $>$::e\_\-nmax (
\begin{DoxyParamCaption}
{}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_a8d0597a08915b021b99fb3c3c16a1b1c}


Return the number of edges in the graph. 



Definition at line 408 of file line\_\-graph.hh.



Referenced by mln::util::line\_\-graph$<$ G $>$::e\_\-ith\_\-nbh\_\-edge(), and mln::util::line\_\-graph$<$ G $>$::edge().

\hypertarget{a00402_ae60488c32468f1ea266c408f98315157}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!e\_\-nmax\_\-nbh\_\-edges@{e\_\-nmax\_\-nbh\_\-edges}}
\index{e\_\-nmax\_\-nbh\_\-edges@{e\_\-nmax\_\-nbh\_\-edges}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{e\_\-nmax\_\-nbh\_\-edges}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ size\_\-t {\bf mln::util::line\_\-graph}$<$ G $>$::e\_\-nmax\_\-nbh\_\-edges (
\begin{DoxyParamCaption}
\item[{const {\bf edge\_\-id\_\-t} \&}]{ id\_\-e}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_ae60488c32468f1ea266c408f98315157}


Return the number max of adjacent edge, given an edge {\ttfamily id\_\-e}. 



Definition at line 451 of file line\_\-graph.hh.



References mln::util::line\_\-graph$<$ G $>$::has\_\-e(), mln::util::line\_\-graph$<$ G $>$::v1(), mln::util::line\_\-graph$<$ G $>$::v2(), and mln::util::line\_\-graph$<$ G $>$::v\_\-nmax\_\-nbh\_\-edges().



Referenced by mln::util::line\_\-graph$<$ G $>$::e\_\-ith\_\-nbh\_\-edge().

\hypertarget{a00402_ab2a90a793518a6c936a235afbb0040b1}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!edge@{edge}}
\index{edge@{edge}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{edge}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ {\bf line\_\-graph}$<$ G $>$::{\bf edge\_\-t} {\bf mln::util::line\_\-graph}$<$ G $>$::{\bf edge} (
\begin{DoxyParamCaption}
\item[{const {\bf edge\_\-id\_\-t} \&}]{ e}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_ab2a90a793518a6c936a235afbb0040b1}


\hyperlink{a00183}{Edge} oriented. 

Return the edge whose id is {\itshape e\/}. 

Definition at line 399 of file line\_\-graph.hh.



References mln::util::line\_\-graph$<$ G $>$::e\_\-nmax().

\hypertarget{a00402_a1cae272a076b8a5d123ed38c8c0f2fa0}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!graph@{graph}}
\index{graph@{graph}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{graph}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ const G \& {\bf mln::util::line\_\-graph}$<$ G $>$::{\bf graph} (
\begin{DoxyParamCaption}
{}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_a1cae272a076b8a5d123ed38c8c0f2fa0}


Return the underlying graph. 



Definition at line 485 of file line\_\-graph.hh.

\hypertarget{a00402_aa8c27349a24557fb3b15c1940045dda6}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!has@{has}}
\index{has@{has}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{has}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ template$<$typename G2 $>$ bool {\bf mln::util::line\_\-graph}$<$ G $>$::has (
\begin{DoxyParamCaption}
\item[{const {\bf util::vertex}$<$ G2 $>$ \&}]{ v}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_aa8c27349a24557fb3b15c1940045dda6}


Check whether a vertex {\ttfamily v} exists in the line graph. 



Definition at line 345 of file line\_\-graph.hh.



References mln::util::vertex$<$ G $>$::graph(), mln::util::line\_\-graph$<$ G $>$::has\_\-v(), and mln::util::vertex$<$ G $>$::id().

\hypertarget{a00402_a246cfd5e2f05b8a37b1d4aa950ae569b}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!has@{has}}
\index{has@{has}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{has}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ template$<$typename G2 $>$ bool {\bf mln::util::line\_\-graph}$<$ G $>$::has (
\begin{DoxyParamCaption}
\item[{const {\bf util::edge}$<$ G2 $>$ \&}]{ e}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_a246cfd5e2f05b8a37b1d4aa950ae569b}


Return whether {\ttfamily e} is in the line graph. 



Definition at line 425 of file line\_\-graph.hh.



References mln::util::edge$<$ G $>$::graph(), mln::util::line\_\-graph$<$ G $>$::has\_\-e(), and mln::util::edge$<$ G $>$::id().

\hypertarget{a00402_afa23cd634fd7debbe957fa738be10df1}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!has\_\-e@{has\_\-e}}
\index{has\_\-e@{has\_\-e}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{has\_\-e}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ bool {\bf mln::util::line\_\-graph}$<$ G $>$::has\_\-e (
\begin{DoxyParamCaption}
\item[{const {\bf util::edge\_\-id\_\-t} \&}]{ id\_\-e}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_afa23cd634fd7debbe957fa738be10df1}


Return whether {\ttfamily id\_\-e} is in the line graph. 



Definition at line 416 of file line\_\-graph.hh.



Referenced by mln::util::line\_\-graph$<$ G $>$::e\_\-ith\_\-nbh\_\-edge(), mln::util::line\_\-graph$<$ G $>$::e\_\-nmax\_\-nbh\_\-edges(), mln::util::line\_\-graph$<$ G $>$::has(), mln::util::line\_\-graph$<$ G $>$::v1(), and mln::util::line\_\-graph$<$ G $>$::v2().

\hypertarget{a00402_a235d2bc518f0602bcc93ff4e008cc4e9}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!has\_\-v@{has\_\-v}}
\index{has\_\-v@{has\_\-v}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{has\_\-v}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ bool {\bf mln::util::line\_\-graph}$<$ G $>$::has\_\-v (
\begin{DoxyParamCaption}
\item[{const {\bf vertex\_\-id\_\-t} \&}]{ id\_\-v}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_a235d2bc518f0602bcc93ff4e008cc4e9}


Check whether a vertex id {\ttfamily id\_\-v} exists in the line graph. 



Definition at line 336 of file line\_\-graph.hh.



Referenced by mln::util::line\_\-graph$<$ G $>$::has(), mln::util::line\_\-graph$<$ G $>$::v\_\-ith\_\-nbh\_\-edge(), mln::util::line\_\-graph$<$ G $>$::v\_\-ith\_\-nbh\_\-vertex(), mln::util::line\_\-graph$<$ G $>$::v\_\-nmax\_\-nbh\_\-edges(), mln::util::line\_\-graph$<$ G $>$::v\_\-nmax\_\-nbh\_\-vertices(), and mln::util::line\_\-graph$<$ G $>$::vertex().

\hypertarget{a00402_abad527eaa75a9267bd5fec6d20e7f84e}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!is\_\-subgraph\_\-of@{is\_\-subgraph\_\-of}}
\index{is\_\-subgraph\_\-of@{is\_\-subgraph\_\-of}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{is\_\-subgraph\_\-of}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ template$<$typename G2 $>$ bool {\bf mln::util::line\_\-graph}$<$ G $>$::is\_\-subgraph\_\-of (
\begin{DoxyParamCaption}
\item[{const G2 \&}]{ g}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_abad527eaa75a9267bd5fec6d20e7f84e}


Return whether this graph is a subgraph Return true if g and $\ast$this have the same graph\_\-id. 



Definition at line 477 of file line\_\-graph.hh.

\hypertarget{a00402_a344e74a5839afa5ffa4351960dc9a467}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!v1@{v1}}
\index{v1@{v1}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{v1}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ {\bf vertex\_\-id\_\-t} {\bf mln::util::line\_\-graph}$<$ G $>$::v1 (
\begin{DoxyParamCaption}
\item[{const {\bf edge\_\-id\_\-t} \&}]{ id\_\-e}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_a344e74a5839afa5ffa4351960dc9a467}


Return the first vertex associated to the edge {\ttfamily id\_\-e}. 



Definition at line 433 of file line\_\-graph.hh.



References mln::util::line\_\-graph$<$ G $>$::has\_\-e().



Referenced by mln::util::line\_\-graph$<$ G $>$::e\_\-ith\_\-nbh\_\-edge(), and mln::util::line\_\-graph$<$ G $>$::e\_\-nmax\_\-nbh\_\-edges().

\hypertarget{a00402_a6ed302d2464b2a5520a4cf394988b530}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!v2@{v2}}
\index{v2@{v2}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{v2}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ {\bf vertex\_\-id\_\-t} {\bf mln::util::line\_\-graph}$<$ G $>$::v2 (
\begin{DoxyParamCaption}
\item[{const {\bf edge\_\-id\_\-t} \&}]{ id\_\-e}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_a6ed302d2464b2a5520a4cf394988b530}


Return the second vertex associated to edge {\ttfamily id\_\-e}. 



Definition at line 442 of file line\_\-graph.hh.



References mln::util::line\_\-graph$<$ G $>$::has\_\-e().



Referenced by mln::util::line\_\-graph$<$ G $>$::e\_\-ith\_\-nbh\_\-edge(), and mln::util::line\_\-graph$<$ G $>$::e\_\-nmax\_\-nbh\_\-edges().

\hypertarget{a00402_a38972a451bcb3db97eeb251ff9f98399}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!v\_\-ith\_\-nbh\_\-edge@{v\_\-ith\_\-nbh\_\-edge}}
\index{v\_\-ith\_\-nbh\_\-edge@{v\_\-ith\_\-nbh\_\-edge}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{v\_\-ith\_\-nbh\_\-edge}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ {\bf edge\_\-id\_\-t} {\bf mln::util::line\_\-graph}$<$ G $>$::v\_\-ith\_\-nbh\_\-edge (
\begin{DoxyParamCaption}
\item[{const {\bf vertex\_\-id\_\-t} \&}]{ id\_\-v, }
\item[{unsigned}]{ i}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_a38972a451bcb3db97eeb251ff9f98399}


Returns the {\ttfamily i} th edge adjacent to the vertex {\ttfamily id\_\-v}. 



Definition at line 363 of file line\_\-graph.hh.



References mln::util::line\_\-graph$<$ G $>$::has\_\-v(), mln::util::line\_\-graph$<$ G $>$::v\_\-nmax(), and mln::util::line\_\-graph$<$ G $>$::v\_\-nmax\_\-nbh\_\-edges().



Referenced by mln::util::line\_\-graph$<$ G $>$::e\_\-ith\_\-nbh\_\-edge(), and mln::util::line\_\-graph$<$ G $>$::v\_\-ith\_\-nbh\_\-vertex().

\hypertarget{a00402_a3f82f2039054e1b760579c97192ada87}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!v\_\-ith\_\-nbh\_\-vertex@{v\_\-ith\_\-nbh\_\-vertex}}
\index{v\_\-ith\_\-nbh\_\-vertex@{v\_\-ith\_\-nbh\_\-vertex}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{v\_\-ith\_\-nbh\_\-vertex}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ {\bf vertex\_\-id\_\-t} {\bf mln::util::line\_\-graph}$<$ G $>$::v\_\-ith\_\-nbh\_\-vertex (
\begin{DoxyParamCaption}
\item[{const {\bf vertex\_\-id\_\-t} \&}]{ id\_\-v, }
\item[{unsigned}]{ i}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_a3f82f2039054e1b760579c97192ada87}


Returns the {\ttfamily i} th vertex adjacent to the vertex {\ttfamily id\_\-v}. 



Definition at line 383 of file line\_\-graph.hh.



References mln::util::line\_\-graph$<$ G $>$::has\_\-v(), and mln::util::line\_\-graph$<$ G $>$::v\_\-ith\_\-nbh\_\-edge().

\hypertarget{a00402_a36b9d86e232e6251a94b35c7f8324baa}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!v\_\-nmax@{v\_\-nmax}}
\index{v\_\-nmax@{v\_\-nmax}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{v\_\-nmax}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ size\_\-t {\bf mln::util::line\_\-graph}$<$ G $>$::v\_\-nmax (
\begin{DoxyParamCaption}
{}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_a36b9d86e232e6251a94b35c7f8324baa}


Return the number of vertices in the graph. 



Definition at line 328 of file line\_\-graph.hh.



Referenced by mln::util::line\_\-graph$<$ G $>$::v\_\-ith\_\-nbh\_\-edge().

\hypertarget{a00402_a548e53b912f3ebf168769713813caa9c}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!v\_\-nmax\_\-nbh\_\-edges@{v\_\-nmax\_\-nbh\_\-edges}}
\index{v\_\-nmax\_\-nbh\_\-edges@{v\_\-nmax\_\-nbh\_\-edges}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{v\_\-nmax\_\-nbh\_\-edges}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ size\_\-t {\bf mln::util::line\_\-graph}$<$ G $>$::v\_\-nmax\_\-nbh\_\-edges (
\begin{DoxyParamCaption}
\item[{const {\bf vertex\_\-id\_\-t} \&}]{ id\_\-v}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_a548e53b912f3ebf168769713813caa9c}


Return the number of adjacent edges of vertex {\ttfamily id\_\-v}. 



Definition at line 354 of file line\_\-graph.hh.



References mln::util::line\_\-graph$<$ G $>$::has\_\-v().



Referenced by mln::util::line\_\-graph$<$ G $>$::e\_\-ith\_\-nbh\_\-edge(), mln::util::line\_\-graph$<$ G $>$::e\_\-nmax\_\-nbh\_\-edges(), mln::util::line\_\-graph$<$ G $>$::v\_\-ith\_\-nbh\_\-edge(), and mln::util::line\_\-graph$<$ G $>$::v\_\-nmax\_\-nbh\_\-vertices().

\hypertarget{a00402_a236216e4f3b061fb8b6485cd770f2f8c}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!v\_\-nmax\_\-nbh\_\-vertices@{v\_\-nmax\_\-nbh\_\-vertices}}
\index{v\_\-nmax\_\-nbh\_\-vertices@{v\_\-nmax\_\-nbh\_\-vertices}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{v\_\-nmax\_\-nbh\_\-vertices}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ size\_\-t {\bf mln::util::line\_\-graph}$<$ G $>$::v\_\-nmax\_\-nbh\_\-vertices (
\begin{DoxyParamCaption}
\item[{const {\bf vertex\_\-id\_\-t} \&}]{ id\_\-v}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_a236216e4f3b061fb8b6485cd770f2f8c}


Return the number of adjacent vertices of vertex {\ttfamily id\_\-v}. 



Definition at line 374 of file line\_\-graph.hh.



References mln::util::line\_\-graph$<$ G $>$::has\_\-v(), and mln::util::line\_\-graph$<$ G $>$::v\_\-nmax\_\-nbh\_\-edges().

\hypertarget{a00402_a633d89c0b2668c693465303aff8c71ea}{
\index{mln::util::line\_\-graph@{mln::util::line\_\-graph}!vertex@{vertex}}
\index{vertex@{vertex}!mln::util::line_graph@{mln::util::line\_\-graph}}
\subsubsection[{vertex}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ {\bf line\_\-graph}$<$ G $>$::vertex\_\-t {\bf mln::util::line\_\-graph}$<$ G $>$::{\bf vertex} (
\begin{DoxyParamCaption}
\item[{const {\bf vertex\_\-id\_\-t} \&}]{ id\_\-v}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{d4/d6d/a00402_a633d89c0b2668c693465303aff8c71ea}


\hyperlink{a00439}{Vertex} oriented. 

Shortcuts factoring the insertion of vertices and edges.

Return the vertex whose id is {\itshape v\/}. 

Definition at line 318 of file line\_\-graph.hh.



References mln::util::line\_\-graph$<$ G $>$::has\_\-v().

