All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
NetworKit::Graph Member List

This is the complete list of members for NetworKit::Graph, including all inherited members.

addEdge(node u, node v, edgeweight ew=defaultEdgeWeight)NetworKit::Graph
addNode()NetworKit::Graph
addNode(float x, float y)NetworKit::Graph
append(const Graph &G)NetworKit::Graph
balancedParallelForNodes(L handle) const NetworKit::Graph
BFSEdgesFrom(node r, L handle) const NetworKit::Graph
BFSfrom(node r, L handle) const NetworKit::Graph
BFSfrom(const std::vector< node > &startNodes, L handle) const NetworKit::Graph
checkConsistency() const NetworKit::Graph
compactEdges()NetworKit::Graph
copyNodes() const NetworKit::Graph
degree(node v) const NetworKit::Graphinline
degreeIn(node v) const NetworKit::Graphinline
degreeOut(node v) const NetworKit::Graphinline
density() const NetworKit::Graphinline
DFSEdgesFrom(node r, L handle) const NetworKit::Graph
DFSfrom(node r, L handle) const NetworKit::Graph
edgeId(node u, node v) const NetworKit::Graph
edges() const NetworKit::Graph
forEdges(L handle) const NetworKit::Graph
forEdgesOf(node u, L handle) const NetworKit::Graph
forInEdgesOf(node u, L handle) const NetworKit::Graph
forInNeighborsOf(node u, L handle) const NetworKit::Graph
forNeighborsOf(node u, L handle) const NetworKit::Graph
forNodePairs(L handle) const NetworKit::Graph
forNodes(L handle) const NetworKit::Graph
forNodesInRandomOrder(L handle) const NetworKit::Graph
forNodesWhile(C condition, L handle) const NetworKit::Graph
getCoordinate(node v)NetworKit::Graphinline
getId() const NetworKit::Graphinline
getIthNeighbor(node u, index i) const NetworKit::Graphinline
getName() const NetworKit::Graphinline
Graph(count n=0, bool weighted=false, bool directed=false)NetworKit::Graph
Graph(const Graph &G, bool weighted, bool directed)NetworKit::Graph
Graph(std::initializer_list< WeightedEdge > edges)NetworKit::Graph
Graph(const Graph &other)=defaultNetworKit::Graph
Graph(Graph &&other)=defaultNetworKit::Graph
GraphBuilder classNetworKit::Graphfriend
hasEdge(node u, node v) const NetworKit::Graph
hasEdgeIds() const NetworKit::Graphinline
hasNode(node v) const NetworKit::Graphinline
increaseWeight(node u, node v, edgeweight ew)NetworKit::Graph
indexEdges(bool force=false)NetworKit::Graph
initCoordinates()NetworKit::Graphinline
isDirected() const NetworKit::Graphinline
isEmpty() const NetworKit::Graphinline
isIsolated(node v) const NetworKit::Graphinline
isWeighted() const NetworKit::Graphinline
maxCoordinate(count dim)NetworKit::Graphinline
merge(const Graph &G)NetworKit::Graph
minCoordinate(count dim)NetworKit::Graphinline
neighbors(node u) const NetworKit::Graph
nodes() const NetworKit::Graph
numberOfEdges() const NetworKit::Graphinline
numberOfNodes() const NetworKit::Graphinline
numberOfSelfLoops() const NetworKit::Graph
operator=(Graph &&other)=defaultNetworKit::Graph
operator=(const Graph &other)=defaultNetworKit::Graph
parallelForEdges(L handle) const NetworKit::Graph
parallelForNodePairs(L handle) const NetworKit::Graph
parallelForNodes(L handle) const NetworKit::Graph
ParallelPartitionCoarsening classNetworKit::Graphfriend
parallelSumForEdges(L handle) const NetworKit::Graph
parallelSumForNodes(L handle) const NetworKit::Graph
randomEdge(bool uniformDistribution=false) const NetworKit::Graph
randomEdges(count nr) const NetworKit::Graph
randomNeighbor(node u) const NetworKit::Graph
randomNode() const NetworKit::Graph
removeEdge(node u, node v)NetworKit::Graph
removeNode(node v)NetworKit::Graph
removeSelfLoops()NetworKit::Graph
restoreNode(node v)NetworKit::Graph
setCoordinate(node v, Point< float > value)NetworKit::Graphinline
setName(std::string name)NetworKit::Graphinline
setWeight(node u, node v, edgeweight ew)NetworKit::Graph
shrinkToFit()NetworKit::Graph
size() const NetworKit::Graphinline
sortEdges()NetworKit::Graph
subgraphFromNodes(const std::unordered_set< node > &nodes) const NetworKit::Graph
swapEdge(NetworKit::node s1, NetworKit::node t1, NetworKit::node s2, NetworKit::node t2)NetworKit::Graph
time()NetworKit::Graphinline
timeStep()NetworKit::Graphinline
toString() const NetworKit::Graph
totalEdgeWeight() const NetworKit::Graph
toUndirected() const NetworKit::Graph
toUnweighted() const NetworKit::Graph
transpose() const NetworKit::Graph
typ() const NetworKit::Graph
upperEdgeIdBound() const NetworKit::Graphinline
upperNodeIdBound() const NetworKit::Graphinline
volume(node v) const NetworKit::Graph
weight(node u, node v) const NetworKit::Graph
weightedDegree(node v) const NetworKit::Graph
~Graph()=defaultNetworKit::Graph