All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
NetworKit::Quadtree< T, poincare > Member List

This is the complete list of members for NetworKit::Quadtree< T, poincare >, including all inherited members.

addContent(T newcomer, double angle, double r)NetworKit::Quadtree< T, poincare >inline
countLeaves() const NetworKit::Quadtree< T, poincare >inline
extractCoordinates(vector< double > &anglesContainer, vector< double > &radiiContainer) const NetworKit::Quadtree< T, poincare >inline
getCellID(double phi, double r) const NetworKit::Quadtree< T, poincare >inline
getElements() const NetworKit::Quadtree< T, poincare >inline
getElementsInHyperbolicCircle(Point2D< double > circleCenter, double hyperbolicRadius) const NetworKit::Quadtree< T, poincare >inline
getElementsInHyperbolicCircle(const Point2D< double > circleCenter, const double hyperbolicRadius, const bool suppressLeft, vector< T > &circleDenizens) const NetworKit::Quadtree< T, poincare >inline
getElementsInHyperbolicCircle(const Point2D< double > circleCenter, const double hyperbolicRadius, vector< T > &circleDenizens) const NetworKit::Quadtree< T, poincare >inline
getElementsProbabilistically(Point2D< double > euQuery, std::function< double(double)> prob, vector< T > &circleDenizens)NetworKit::Quadtree< T, poincare >inline
getElementsProbabilistically(Point2D< double > euQuery, std::function< double(double)> prob, bool suppressLeft, vector< T > &circleDenizens)NetworKit::Quadtree< T, poincare >inline
getMaxRadius() const NetworKit::Quadtree< T, poincare >inline
height() const NetworKit::Quadtree< T, poincare >inline
indexSubtree(index nextID)NetworKit::Quadtree< T, poincare >inline
Quadtree()NetworKit::Quadtree< T, poincare >inline
Quadtree(double maxR, bool theoreticalSplit=false, double alpha=1, count capacity=1000, double balance=0.5)NetworKit::Quadtree< T, poincare >inline
Quadtree(const vector< double > &angles, const vector< double > &radii, const vector< T > &content, double stretch, bool theoreticalSplit=false, double alpha=1, count capacity=1000, double balance=0.5)NetworKit::Quadtree< T, poincare >inline
QuadTreeGTest classNetworKit::Quadtree< T, poincare >friend
recount()NetworKit::Quadtree< T, poincare >inline
reindex()NetworKit::Quadtree< T, poincare >inline
removeContent(T toRemove, double angle, double r)NetworKit::Quadtree< T, poincare >inline
size() const NetworKit::Quadtree< T, poincare >inline
trim()NetworKit::Quadtree< T, poincare >inline