All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Public Member Functions | List of all members
NetworKit::AlgebraicMatchingCoarsening< Matrix > Class Template Reference

Implements an algebraic version of the MatchingCoarsening algorithm by computing a projection matrix from fine to coarse. More...

#include <AlgebraicMatchingCoarsening.h>

Public Member Functions

 AlgebraicMatchingCoarsening (const Graph &graph, const Matching &matching, bool noSelfLoops=false)
 Constructs an instance of AlgebraicMatchingCoarsening for the given Graph graph and the corresponding Matching matching. More...
 
void run () override
 Computes the coarsening for the graph using the given matching. More...
 
- Public Member Functions inherited from NetworKit::GraphCoarsening
 GraphCoarsening (const Graph &G)
 
virtual ~GraphCoarsening ()=default
 
Graph getCoarseGraph () const
 
std::vector< nodegetFineToCoarseNodeMapping () const
 Get mapping from fine to coarse node. More...
 
std::map< node, std::vector
< node > > 
getCoarseToFineNodeMapping () const
 Get mapping from coarse node to collection of fine nodes. More...
 
- Public Member Functions inherited from NetworKit::Algorithm
 Algorithm ()
 Constructor to the algorithm base class. More...
 
virtual ~Algorithm ()=default
 Virtual default destructor. More...
 
bool hasFinished () const
 Indicates whether an algorithm has completed computation or not. More...
 
void assureFinished () const
 Assure that the algorithm has been run, throws a std::runtime_error otherwise. More...
 
virtual std::string toString () const
 Returns a string with the algorithm's name and its parameters, if there are any. More...
 
virtual bool isParallel () const
 

Additional Inherited Members

- Protected Attributes inherited from NetworKit::GraphCoarsening
const GraphG
 
Graph Gcoarsened
 
std::vector< nodenodeMapping
 
- Protected Attributes inherited from NetworKit::Algorithm
bool hasRun
 A boolean variable indicating whether an algorithm has finished its computation or not. More...
 

Detailed Description

template<class Matrix>
class NetworKit::AlgebraicMatchingCoarsening< Matrix >

Implements an algebraic version of the MatchingCoarsening algorithm by computing a projection matrix from fine to coarse.

Constructor & Destructor Documentation

template<class Matrix >
NetworKit::AlgebraicMatchingCoarsening< Matrix >::AlgebraicMatchingCoarsening ( const Graph graph,
const Matching matching,
bool  noSelfLoops = false 
)

Constructs an instance of AlgebraicMatchingCoarsening for the given Graph graph and the corresponding Matching matching.

If noSelfLoops is set to true (false by default), no self-loops are created during the coarsening.

Parameters
graph
matching
noSelfLoops

Member Function Documentation

template<class Matrix >
void NetworKit::AlgebraicMatchingCoarsening< Matrix >::run ( )
overridevirtual

Computes the coarsening for the graph using the given matching.

Implements NetworKit::GraphCoarsening.


The documentation for this class was generated from the following file: