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

#include <ClusteringProjector.h>

Public Member Functions

virtual Partition projectBack (const Graph &Gcoarse, const Graph &Gfine, const std::vector< node > &fineToCoarse, const Partition &zetaCoarse)
 DEPRECATED. More...
 
virtual Partition projectBackToFinest (const Partition &zetaCoarse, const std::vector< std::vector< node > > &maps, const Graph &Gfinest)
 Project a clustering ^{i} of the coarse graph G^{i} back to the finest graph G^{0}, using the hierarchy of fine->coarse maps. More...
 
virtual Partition projectCoarseGraphToFinestClustering (const Graph &Gcoarse, const Graph &Gfinest, const std::vector< std::vector< node > > &maps)
 Assuming that the coarse graph resulted from contracting and represents a clustering of the finest graph. More...
 

Member Function Documentation

Partition NetworKit::ClusteringProjector::projectBack ( const Graph Gcoarse,
const Graph Gfine,
const std::vector< node > &  fineToCoarse,
const Partition zetaCoarse 
)
virtual

DEPRECATED.

Given

Parameters
[in]Gcoarse
[in]Gfine
[in]fineToCoarse
[in]zetaCoarsea clustering of the coarse graph

, project the clustering back to the fine graph to create a clustering of the fine graph.

Parameters
[out]aclustering of the fine graph Given
[in]Gcoarse
[in]Gfine
[in]fineToCoarse
[in]zetaCoarsea clustering of the coarse graph

, project the clustering back to the fine graph to create a clustering of the fine graph.

Parameters
[out]aclustering of the fine graph
Partition NetworKit::ClusteringProjector::projectBackToFinest ( const Partition zetaCoarse,
const std::vector< std::vector< node > > &  maps,
const Graph Gfinest 
)
virtual

Project a clustering ^{i} of the coarse graph G^{i} back to the finest graph G^{0}, using the hierarchy of fine->coarse maps.

Partition NetworKit::ClusteringProjector::projectCoarseGraphToFinestClustering ( const Graph Gcoarse,
const Graph Gfinest,
const std::vector< std::vector< node > > &  maps 
)
virtual

Assuming that the coarse graph resulted from contracting and represents a clustering of the finest graph.

Parameters
[in]Gcoarsecoarse graph
[in]Gfinestfinest graph
[in]mapshierarchy of maps M^{i->i+1} mapping nodes in finer graph to supernodes in coarser graph

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