\hypertarget{classCXXGRAPH_1_1PARTITIONING_1_1EdgeBalancedVertexCut}{}\doxysection{CXXGRAPH\+::PARTITIONING\+::Edge\+Balanced\+Vertex\+Cut$<$ T $>$ Class Template Reference}
\label{classCXXGRAPH_1_1PARTITIONING_1_1EdgeBalancedVertexCut}\index{CXXGRAPH::PARTITIONING::EdgeBalancedVertexCut$<$ T $>$@{CXXGRAPH::PARTITIONING::EdgeBalancedVertexCut$<$ T $>$}}


A Vertex Cut Partioning Algorithm that assign an edge in the partition with less load.  




{\ttfamily \#include $<$Edge\+Balanced\+Vertex\+Cut.\+hpp$>$}



Inheritance diagram for CXXGRAPH\+::PARTITIONING\+::Edge\+Balanced\+Vertex\+Cut$<$ T $>$\+:\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=229pt]{db/d73/classCXXGRAPH_1_1PARTITIONING_1_1EdgeBalancedVertexCut__inherit__graph}
\end{center}
\end{figure}


Collaboration diagram for CXXGRAPH\+::PARTITIONING\+::Edge\+Balanced\+Vertex\+Cut$<$ T $>$\+:\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=229pt]{db/dfe/classCXXGRAPH_1_1PARTITIONING_1_1EdgeBalancedVertexCut__coll__graph}
\end{center}
\end{figure}
\doxysubsection*{Public Member Functions}
\begin{DoxyCompactItemize}
\item 
\mbox{\Hypertarget{classCXXGRAPH_1_1PARTITIONING_1_1EdgeBalancedVertexCut_a7971a7d98b29a3c5e1bb5196ef177830}\label{classCXXGRAPH_1_1PARTITIONING_1_1EdgeBalancedVertexCut_a7971a7d98b29a3c5e1bb5196ef177830}} 
{\bfseries Edge\+Balanced\+Vertex\+Cut} (\mbox{\hyperlink{classCXXGRAPH_1_1PARTITIONING_1_1Globals}{Globals}} \&G)
\item 
\mbox{\Hypertarget{classCXXGRAPH_1_1PARTITIONING_1_1EdgeBalancedVertexCut_a70881e410713abc86203cb5e8ae24d2d}\label{classCXXGRAPH_1_1PARTITIONING_1_1EdgeBalancedVertexCut_a70881e410713abc86203cb5e8ae24d2d}} 
void {\bfseries perform\+Step} (const \mbox{\hyperlink{classCXXGRAPH_1_1Edge}{Edge}}$<$ T $>$ \&e, \mbox{\hyperlink{classCXXGRAPH_1_1PARTITIONING_1_1PartitionState}{Partition\+State}}$<$ T $>$ \&Sstate)
\end{DoxyCompactItemize}


\doxysubsection{Detailed Description}
\subsubsection*{template$<$typename T$>$\newline
class CXXGRAPH\+::\+PARTITIONING\+::\+Edge\+Balanced\+Vertex\+Cut$<$ T $>$}

A Vertex Cut Partioning Algorithm that assign an edge in the partition with less load. 

This algorithm is a greedy algorithm that assign an edge in the partition with less load ~\newline
 

The documentation for this class was generated from the following file\+:\begin{DoxyCompactItemize}
\item 
/github/workspace/include/\+Partitioning/Edge\+Balanced\+Vertex\+Cut.\+hpp\end{DoxyCompactItemize}
