All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages

Class Hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 1234]

OptionParser::Parser::Action | |

NetworKit::Algorithm | |

NetworKit::AllSimplePaths | Determines all the possible simple paths from a given source node to a target node of a directed unweighted graph |

NetworKit::ApproximatePageRank | Computes an approximate PageRank vector from a given seed |

Aux::FunctionTraits< F >::arg< N > | |

OptionParser::Arg | Functions for checking the validity of option arguments |

Aux::FunctionTraits< R(Args...)>::arg< N > | |

ArithmeticSemiring | Add: arithmetic add mult: arithmetic multiplication zero: 0 one: 1 codomain = (-infty, +infty) |

Aux::Checkers::Asserter | Checks the bool via assert |

NetworKit::AttributizedEdge< T > | |

ttmath::Big< exp, man > | Big implements the floating point numbers |

Aux::BloomFilter | Bloom filter for fast set membership queries for type index with one-sided error (false positives) |

NetworKit::BoundingBox< T > | Bounding box used by the Octree class |

ttmath::CGamma< ValueType > | |

NetworKit::circle | |

NetworKit::ClusteringCoefficient | |

NetworKit::ClusteringGenerator | Provides several methods for generating special clusterings |

NetworKit::ClusteringProjector | |

NetworKit::CompareDist | |

ttmath::Conv | |

NetworKit::Coordinates< T > | DEPRECATED: A specialized container for node coordinates is no longer consistent with NetworKit's approach to node attributes |

NetworKit::Coordinates< float > | |

NetworKit::Cover | Implements a cover of a set, i.e |

NetworKit::CoverReader | |

NetworKit::CoverWriter | Write a clustering to a file |

NetworKit::CSRMatrix | Sparse matrix stored in CSR-Format (i.e |

ttmath::Dec< value_size, dec_digits > | |

NetworKit::DenseMatrix | Represents a dense matrix |

OptionParser::Descriptor | Describes an option, its help text (usage) and how it should be parsed |

NetworKit::DGSStreamParser | |

NetworKit::DGSWriter | |

NetworKit::DiagonalPreconditioner | Simple preconditioner that approximates the matrix by a diagonal matrix |

NetworKit::DissimilarityMeasure | Base class for all clustering dissimilarity measures |

NetworKit::DotGraphWriter | This class turns a graph into a very basic GraphViz file as documented in the official manual [1] |

NetworKit::DotPartitionWriter | |

NetworKit::DynAlgorithm | |

NetworKit::DynamicGraphGenerator | Abstract base class for a dynamic graph generator (in the new dynamic architecture) |

NetworKit::DynamicGraphReader | |

NetworKit::DynamicGraphSource | |

NetworKit::DynamicMatrix | Matrix that is optimized for sparse matrices and internally uses a graph data structure |

NetworKit::Eccentricity | |

NetworKit::Edge | |

NetworKit::EdgeListPartitionReader | |

NetworKit::EdgeListWriter | A writer for the edge list format |

NetworKit::EdgeScoreAsWeight | |

NetworKit::EdgeScoring< T > | Abstract base class for algorithms associating a score with an edge |

NetworKit::EdmondsKarp | Implements the maximum flow algorithm by Edmonds and Karp |

NetworKit::EliminationStage< Matrix > | |

Aux::Checkers::Enforcer | Checks to bool via enforce |

NetworKit::EvaluationMetric | Abstract base class for evaluation curves |

exception | |

ttmath::ExceptionInfo | |

false_type | |

NetworKit::ForwardEdge | |

Aux::FunctionTraits< F > | |

Aux::FunctionTraits< R(Args...)> | |

Aux::FunctionTraits< R(C &)> | |

Aux::FunctionTraits< R(C &, Args...)> | |

GaloisFieldSemiring | Add: xor mult: bitwise and zero: 0 one: 1 codomain = [0, 1] |

NetworKit::GlobalClusteringCoefficient | |

NetworKit::GlobalThresholdFilter | Calculates a sparsified graph by applying a global threshold to an edge score |

NetworKit::Graph | A graph (with optional weights) and parallel iterator methods |

NetworKit::GraphBuilder | |

NetworKit::GraphDistance | |

NetworKit::GraphEvent | |

NetworKit::GraphEventHandler | |

NetworKit::GraphEventProxy | This class enables the observer pattern for dynamic graphs: It has the same modifiers as a Graph object |

NetworKit::GraphIO | |

NetworKit::GraphLayoutAlgorithm< T > | Abstract base class for algorithms that compute a layout of the Graph vertices in d-dimensional space |

NetworKit::GraphLayoutAlgorithm< double > | |

NetworKit::GraphReader | Abstract base class for graph readers |

NetworKit::GraphUpdater | |

NetworKit::GraphWriter | Abstract base class for graph writers |

NetworKit::greater | |

std::hash< NetworKit::Edge > | |

ttmath::History< ValueType > | |

NetworKit::HyperbolicSpace | |

NetworKit::IdentityPreconditioner | Simple preconditioner that returns the given vector unchanged |

Aux::Checkers::Ignorer | Won't look at the bool (not even in debug-mode, which is how this differs from Asserter) |

NetworKit::IncompleteSSSP | Abstract base class for single-source shortest path algorithms that return the nodes in order of increasing distance from the source and do not necessarily need to compute all distances |

NetworKit::IndependentSetFinder | DEPRECATED: put into code archive, nobody seems to be using it Abstract base class for independent set algorithms |

Aux::Parsing::Impl::IntegerTag | |

IntLogicalSemiring | Add: logical or mult: logical and zero: 0 one: 1 codomain = [-infty, +infty] |

Aux::Impl::IsIteratableHelper | |

Aux::Impl::IsStreamableHelper | |

OptionParser::PrintUsageImplementation::IStringWriter | |

ttmath::Parser< ValueType >::Item | |

ttmath::Objects::Item | |

NetworKit::LAMGSolverStatus | Status parameters of the solver |

NetworKit::LayoutAlgorithm | Base class for graph layout algorithms, i.e |

Layouter | |

NetworKit::Level< Matrix > | Abstract base class for an LAMG Level |

NetworKit::LevelHierarchy< Matrix > | |

NetworKit::LinearSolver< Matrix > | Abstract base class for solvers that solve linear systems |

NetworKit::LinearSolver< NetworKit::CSRMatrix > | |

NetworKit::LineFileReader | Reads a file and puts each line as a string into a vector |

OptionParser::PrintUsageImplementation::LinePartIterator | |

OptionParser::PrintUsageImplementation::LineWrapper | |

NetworKit::LinkPredictor | Abstract base class for link predictors |

NetworKit::ListEntry_struct | |

Aux::Log::Location | |

logic_error | |

NetworKit::Matching | |

NetworKit::MatrixReader | Abstract base class for matrix readers |

MaxMinSemiring | Add: max mult: min zero: -infty one: +infty codomain = [-infty, +infty] |

MaxPlusSemiring | Add: max mult: arithmetic add zero: -infty one: 0 codomain = [-infty, +infty) |

NetworKit::METISParser | Parser for the METIS file format |

MinMaxSemiring | Add: min mult: max zero: +infty one: -infty codomain = [-infty, +infty] |

MinPlusSemiring | Add: min mult: arithmetic add zero: +infty one: 0 codomain = (-infty, +infty] |

ttmath::Misc | |

NetworKit::MissingLinksFinder | Allows the user to find missing links in the given graph |

NetworKit::MultiLevelSetup< Matrix > | Implements the setup phase of LAMG (Lean Algebraic Multigrid by Livne et al.) |

NetworKit::MultiLevelSetup< NetworKit::CSRMatrix > | |

NetworKit::MyEdge | |

NetworKit::NeighborhoodUtility | Provides basic operations on neighborhoods in a given graph |

NetworKit::NodeDistance | Abstract base class for node distance measures |

ttmath::Objects | |

NetworKit::Octree< T > | Implementation of a k-dimensional octree for the purpose of Barnes-Hut approximation |

NetworKit::OctreeNode< T > | Node in the octree data structure |

OptionParser::Option | A parsed option from the command line together with its argument if it has one |

NetworKit::Overlapper | Abstract base class for algorithms which determine the overlap of multiple partitions |

ttmath::Parser< ValueType > | Mathematical parser |

OptionParser::Parser | Checks argument vectors for validity and parses them into data structures that are easier to work with |

NetworKit::Partition | Implements a partition of a set, i.e |

NetworKit::PartitionIntersection | Class for calculating the intersection of two partitions, i.e |

NetworKit::PartitionReader | |

NetworKit::PartitionWriter | Write a clustering to a file |

NetworKit::Point< T > | Formerly marked as deprecated: To take advantage of automatic mapping between C++ and Python data structures, use standard library containers (std::pair, std::tuple..) instead |

NetworKit::Point2D< T > | Points in any dimension of templated type |

NetworKit::Point2D< double > | |

NetworKit::Point< double > | |

NetworKit::Point< float > | |

NetworKit::PostscriptWriter | EPS output of graphs with 2D coordinates |

NetworKit::PowerlawDegreeSequence | |

NetworKit::PredictionsSorter | Allows the sorting of predictions by score or node-pair |

Aux::Impl::PrintableCategoryTag< Tag > | |

Aux::Impl::printTupleHelper< Tuple, I, TupleSize > | |

Aux::Impl::printTupleHelper< Tuple, I, I > | |

OptionParser::PrintUsageImplementation | |

Aux::PrioQueue< Key, Value > | Priority queue with extract-min and decrease-key |

Aux::PrioQueue< int64_t, index > | |

Aux::PrioQueueForInts | Addressable priority queue for elements in the range [0,n) and integer priorities in the range [0, maxPrio] |

NetworKit::QuadNode< T, poincare > | |

NetworKit::QuadNode< index, poincare > | |

NetworKit::QuadNodeCartesianEuclid< T > | |

NetworKit::QuadNodePolarEuclid< T > | |

NetworKit::Quadtree< T, poincare > | |

NetworKit::Quadtree< index, false > | |

NetworKit::QuadtreeCartesianEuclid< T > | |

NetworKit::QuadtreePolarEuclid< T > | |

NetworKit::QualityMeasure | Abstract base class for all clustering quality measures |

NetworKit::RankedEdge | A directed edge with a simmelianness int value |

NetworKit::RasterReader | Reader for NASA raster data of population |

Aux::Parsing::Impl::RealTag | |

NetworKit::Redundancy | Represents the result of the comparison of two ranked neighborhood lists, namely the overlap of the top-k neighbors and the maximum jaccard index |

NetworKit::MaxentStress::ResultStats | |

runtime_error | |

NetworKit::Sampling | |

NetworKit::SelectiveCommunityDetector | |

Aux::SetIntersector< T > | Provides set intersection for sets with entries from 0 to an upper bound (exclusive) |

Aux::SignalHandler | |

NetworKit::Smoother< Matrix > | Abstract base class of a smoother |

NetworKit::Smoother< NetworKit::CSRMatrix > | |

NetworKit::SNAPEdgeListPartitionReader | Reads the clustering files from the SNAP collection |

NetworKit::SolverLamg< Matrix > | Implements the solve phase of LAMG (Lean Algebraic Multigrid by Livne et al.) |

NetworKit::SolverStatus | Describes the status of a LinearSolver after the solver finished |

NetworKit::SpanningForest | Base class for spanning forest/tree algorithms |

NetworKit::SparseAccumulator | Sparse accumulator datastructure as described in Kepner, Jeremy, and John Gilbert, eds |

NetworKit::Sparsifier | In this file, edge score calculators and edge score filters are combined into different sparsification algorithms |

NetworKit::StaticGraphGenerator | Abstract base class for static graph generators |

OptionParser::Stats | Determines the minimum lengths of the buffer and options arrays used for Parser |

ttmath::StopCalculating | |

NetworKit::StronglyConnectedComponents | Determines the strongly connected components of an directed graph |

Aux::Checkers::Terminator | Calls std::terminate if the bool is false |

ttmath::ThreadLock | |

Aux::Timer | A timer for running time measurements |

NetworKit::Triplet | Represents a matrix entry s.t |

true_type | |

ttmath::UInt< value_size > | UInt implements a big integer value without a sign |

ttmath::UInt< 0 > | |

ttmath::UInt< man > | |

NetworKit::UnionFind | Implements the Union Find data structure to maintain disjoint sets efficiently |

NetworKit::Vector | Basic vector with double coefficients |

NetworKit::WeightedEdge | A weighted edge used for the graph constructor with initializer list syntax |