Defined in File Algorithm.hpp
public NetworKit::EdgeScore< double > (Template Class EdgeScore)
public NetworKit::EdgeScore< count > (Template Class EdgeScore)
public NetworKit::APSP (Class APSP)
public NetworKit::AffectedNodes (Class AffectedNodes)
public NetworKit::AlgebraicBFS< Matrix > (Template Class AlgebraicBFS)
public NetworKit::AlgebraicBellmanFord< Matrix > (Template Class AlgebraicBellmanFord)
public NetworKit::AlgebraicTriangleCounting< Matrix > (Template Class AlgebraicTriangleCounting)
public NetworKit::AllSimplePaths (Class AllSimplePaths)
public NetworKit::ApproxGroupBetweenness (Class ApproxGroupBetweenness)
public NetworKit::ApproxSpanningEdge (Class ApproxSpanningEdge)
public NetworKit::Assortativity (Class Assortativity)
public NetworKit::BiconnectedComponents (Class BiconnectedComponents)
public NetworKit::Centrality (Class Centrality)
public NetworKit::CommunityDetectionAlgorithm (Class CommunityDetectionAlgorithm)
public NetworKit::CommuteTimeDistance (Class CommuteTimeDistance)
public NetworKit::ComplexPathAlgorithm (Class ComplexPathAlgorithm)
public NetworKit::ComponentDecomposition (Class ComponentDecomposition)
public NetworKit::Curveball (Class Curveball)
public NetworKit::DegreePreservingShuffle (Class DegreePreservingShuffle)
public NetworKit::Diameter (Class Diameter)
public NetworKit::DynBetweennessOneNode (Class DynBetweennessOneNode)
public NetworKit::DynTopHarmonicCloseness (Class DynTopHarmonicCloseness)
public NetworKit::EdgeScore< T > (Template Class EdgeScore)
public NetworKit::EdgeSwitching (Class EdgeSwitching)
public NetworKit::EdgeSwitchingInPlace (Class EdgeSwitchingInPlace)
public NetworKit::EdmondsKarp (Class EdmondsKarp)
public NetworKit::EffectiveDiameter (Class EffectiveDiameter)
public NetworKit::EffectiveDiameterApproximation (Class EffectiveDiameterApproximation)
public NetworKit::EpidemicSimulationSEIR (Class EpidemicSimulationSEIR)
public NetworKit::GedWalk (Class GedWalk)
public NetworKit::GlobalCurveball (Class GlobalCurveball)
public NetworKit::GraphCoarsening (Class GraphCoarsening)
public NetworKit::GraphDifference (Class GraphDifference)
public NetworKit::GroupCloseness (Class GroupCloseness)
public NetworKit::GroupClosenessGrowShrink (Class GroupClosenessGrowShrink)
public NetworKit::GroupClosenessLocalSearch (Class GroupClosenessLocalSearch)
public NetworKit::GroupClosenessLocalSearch::GroupClosenessLocalSearchInterface (Class GroupClosenessLocalSearch::GroupClosenessLocalSearchInterface)
public NetworKit::GroupClosenessLocalSwaps (Class GroupClosenessLocalSwaps)
public NetworKit::GroupDegree (Class GroupDegree)
public NetworKit::GroupHarmonicCloseness (Class GroupHarmonicCloseness)
public NetworKit::GroupHarmonicCloseness::GroupHarmonicClosenessInterface (Class GroupHarmonicCloseness::GroupHarmonicClosenessInterface)
public NetworKit::HopPlotApproximation (Class HopPlotApproximation)
public NetworKit::KadabraBetweenness (Class KadabraBetweenness)
public NetworKit::LFRGenerator (Class LFRGenerator)
public NetworKit::LocalCommunityEvaluation (Class LocalCommunityEvaluation)
public NetworKit::Matcher (Class Matcher)
public NetworKit::MaximalCliques (Class MaximalCliques)
public NetworKit::NeighborhoodFunction (Class NeighborhoodFunction)
public NetworKit::NeighborhoodFunctionApproximation (Class NeighborhoodFunctionApproximation)
public NetworKit::NeighborhoodFunctionHeuristic (Class NeighborhoodFunctionHeuristic)
public NetworKit::Node2Vec (Class Node2Vec)
public NetworKit::OverlappingCommunityDetectionAlgorithm (Class OverlappingCommunityDetectionAlgorithm)
public NetworKit::PermanenceCentrality (Class PermanenceCentrality)
public NetworKit::PowerlawDegreeSequence (Class PowerlawDegreeSequence)
public NetworKit::PrunedLandmarkLabeling (Class PrunedLandmarkLabeling)
public NetworKit::RandomMaximumSpanningForest (Class RandomMaximumSpanningForest)
public NetworKit::ReachableNodes (Class ReachableNodes)
public NetworKit::SCDGroundTruthComparison (Class SCDGroundTruthComparison)
public NetworKit::SPSP (Class SPSP)
public NetworKit::SSSP (Class SSSP)
public NetworKit::STSP (Class STSP)
public NetworKit::SetConductance (Class SetConductance)
public NetworKit::SpanningForest (Class SpanningForest)
public NetworKit::TopCloseness (Class TopCloseness)
public NetworKit::TopHarmonicCloseness (Class TopHarmonicCloseness)
public NetworKit::TopologicalSort (Class TopologicalSort)
public NetworKit::UnionMaximumSpanningForest (Class UnionMaximumSpanningForest)
Subclassed by NetworKit::EdgeScore< double >, NetworKit::EdgeScore< count >, NetworKit::APSP, NetworKit::AffectedNodes, NetworKit::AlgebraicBFS< Matrix >, NetworKit::AlgebraicBellmanFord< Matrix >, NetworKit::AlgebraicTriangleCounting< Matrix >, NetworKit::AllSimplePaths, NetworKit::ApproxGroupBetweenness, NetworKit::ApproxSpanningEdge, NetworKit::Assortativity, NetworKit::BiconnectedComponents, NetworKit::Centrality, NetworKit::CommunityDetectionAlgorithm, NetworKit::CommuteTimeDistance, NetworKit::ComplexPathAlgorithm, NetworKit::ComponentDecomposition, NetworKit::Curveball, NetworKit::DegreePreservingShuffle, NetworKit::Diameter, NetworKit::DynBetweennessOneNode, NetworKit::DynTopHarmonicCloseness, NetworKit::EdgeScore< T >, NetworKit::EdgeSwitching, NetworKit::EdgeSwitchingInPlace, NetworKit::EdmondsKarp, NetworKit::EffectiveDiameter, NetworKit::EffectiveDiameterApproximation, NetworKit::EpidemicSimulationSEIR, NetworKit::GedWalk, NetworKit::GlobalCurveball, NetworKit::GraphCoarsening, NetworKit::GraphDifference, NetworKit::GroupCloseness, NetworKit::GroupClosenessGrowShrink, NetworKit::GroupClosenessLocalSearch, NetworKit::GroupClosenessLocalSearch::GroupClosenessLocalSearchInterface, NetworKit::GroupClosenessLocalSwaps, NetworKit::GroupDegree, NetworKit::GroupHarmonicCloseness, NetworKit::GroupHarmonicCloseness::GroupHarmonicClosenessInterface, NetworKit::HopPlotApproximation, NetworKit::KadabraBetweenness, NetworKit::LFRGenerator, NetworKit::LocalCommunityEvaluation, NetworKit::Matcher, NetworKit::MaximalCliques, NetworKit::NeighborhoodFunction, NetworKit::NeighborhoodFunctionApproximation, NetworKit::NeighborhoodFunctionHeuristic, NetworKit::Node2Vec, NetworKit::OverlappingCommunityDetectionAlgorithm, NetworKit::PermanenceCentrality, NetworKit::PowerlawDegreeSequence, NetworKit::PrunedLandmarkLabeling, NetworKit::RandomMaximumSpanningForest, NetworKit::ReachableNodes, NetworKit::SCDGroundTruthComparison, NetworKit::SPSP, NetworKit::SSSP, NetworKit::STSP, NetworKit::SetConductance, NetworKit::SpanningForest, NetworKit::TopCloseness, NetworKit::TopHarmonicCloseness, NetworKit::TopologicalSort, NetworKit::UnionMaximumSpanningForest
Public Functions
The generic run method which calls runImpl() and takes care of setting hasRun to the appropriate value.
Indicates whether an algorithm has completed computation or not.
The value of hasRun.
Assure that the algorithm has been run, throws a std::runtime_error otherwise.
Protected Attributes