@ladybugmem/icebug 0.1.0 → 0.1.2

package/vendor/include/networkit/linkprediction/RandomLinkSampler.hpp

@@ -1,47 +0,0 @@
-/*
- * RandomLinkSampler.hpp
- *
- *  Created on: 28.02.2015
- *      Author: Kolja Esders
- */
-
-#ifndef NETWORKIT_LINKPREDICTION_RANDOM_LINK_SAMPLER_HPP_
-#define NETWORKIT_LINKPREDICTION_RANDOM_LINK_SAMPLER_HPP_
-
-#include <utility>
-
-#include <networkit/graph/GraphW.hpp>
-
-namespace NetworKit {
-
-/**
- * @ingroup linkprediction
- *
- * Provides methods to randomly sample a number of edges from a given graph.
- */
-namespace RandomLinkSampler {
-
-/**
- * Returns a graph that contains @a percentage percent of links form the given graph @a G.
- * The links are randomly selected from @a G until the given percentage is reached.
- * @param G The graph to construct the training graph from
- * @param percentage Percentage of links regarding the number of links in the
- * given graph that should be in the returned graph
- * @return a graph that contains the given percentage of links from @a G
- */
-GraphW byPercentage(const Graph &G, double percentage);
-
-/**
- * Returns a graph that contains @a numLinks links from the given graph @a G.
- * The links are randomly selected from @a G until the given count is reached.
- * @param G The graph to construct the training graph from
- * @param numLinks Number of links the returned graph should consist of
- * @return a graph that contains the given number of links from @a G
- */
-GraphW byCount(const Graph &G, count numLinks);
-
-} // namespace RandomLinkSampler
-
-} // namespace NetworKit
-
-#endif // NETWORKIT_LINKPREDICTION_RANDOM_LINK_SAMPLER_HPP_

package/vendor/include/networkit/linkprediction/ResourceAllocationIndex.hpp

@@ -1,38 +0,0 @@
-/*
- * ResourceAllocationIndex.hpp
- *
- *  Created on: 11.04.2015
- *      Author: Kolja Esders (kolja.esders@student.kit.edu)
- */
-
-#ifndef NETWORKIT_LINKPREDICTION_RESOURCE_ALLOCATION_INDEX_HPP_
-#define NETWORKIT_LINKPREDICTION_RESOURCE_ALLOCATION_INDEX_HPP_
-
-#include <networkit/linkprediction/LinkPredictor.hpp>
-
-namespace NetworKit {
-
-/**
- * @ingroup linkprediction
- *
- * Implementation of the ResourceAllocationIndex.
- * The index is similar to Adamic/Adar and sums up the reciprocals of
- * the degree of all common neighbors of u and v.
- */
-class ResourceAllocationIndex : public LinkPredictor {
-private:
-    /**
-     * Returns the Resource Allocation Index of the given node-pair (@a u, @a v).
-     * @param u First node
-     * @param v Second node
-     * @return the Resource Allocation Index of the given node-pair (@a u, @a v)
-     */
-    double runImpl(node u, node v) override;
-
-public:
-    using LinkPredictor::LinkPredictor;
-};
-
-} // namespace NetworKit
-
-#endif // NETWORKIT_LINKPREDICTION_RESOURCE_ALLOCATION_INDEX_HPP_

package/vendor/include/networkit/linkprediction/SameCommunityIndex.hpp

@@ -1,50 +0,0 @@
-/*
- * SameCommunityIndex.hpp
- *
- *  Created on: 07.04.2015
- *      Author: Kolja Esders
- */
-
-#ifndef NETWORKIT_LINKPREDICTION_SAME_COMMUNITY_INDEX_HPP_
-#define NETWORKIT_LINKPREDICTION_SAME_COMMUNITY_INDEX_HPP_
-
-#include <networkit/linkprediction/LinkPredictor.hpp>
-#include <networkit/structures/Partition.hpp>
-
-namespace NetworKit {
-
-/**
- * @ingroup linkprediction
- *
- * Index to determine whether two nodes are in the same community.
- */
-class SameCommunityIndex final : public LinkPredictor {
-    Partition communities; //!< The communities of the current graph
-
-    /**
-     * Returns 1 if the given nodes @a u and @a v are in the same community, 0 otherwise.
-     * @param u First node
-     * @param v Second node
-     * @return 1 if the given nodes @a u and @a v are in the same community, 0 otherwise
-     */
-    double runImpl(node u, node v) override;
-
-public:
-    SameCommunityIndex();
-
-    /**
-     *
-     * @param G The graph to work on
-     */
-    explicit SameCommunityIndex(const Graph &G);
-
-    /**
-     * Sets the graph to work on.
-     * @param newGraph The graph to work on
-     */
-    void setGraph(const Graph &newGraph) override;
-};
-
-} // namespace NetworKit
-
-#endif // NETWORKIT_LINKPREDICTION_SAME_COMMUNITY_INDEX_HPP_

package/vendor/include/networkit/linkprediction/TotalNeighborsIndex.hpp

@@ -1,39 +0,0 @@
-/*
- * TotalNeighborsIndex.hpp
- *
- *  Created on: 05.04.2015
- *      Author: Kolja Esders
- */
-
-#ifndef NETWORKIT_LINKPREDICTION_TOTAL_NEIGHBORS_INDEX_HPP_
-#define NETWORKIT_LINKPREDICTION_TOTAL_NEIGHBORS_INDEX_HPP_
-
-#include <networkit/linkprediction/LinkPredictor.hpp>
-
-namespace NetworKit {
-
-/**
- * @ingroup linkprediction
- *
- * Implementation of the Total Neighbors Index.
- * This index is also known as Total Friends Index and returns
- * the number of nodes in the neighborhood-union of u and v.
- */
-class TotalNeighborsIndex final : public LinkPredictor {
-    /**
-     * Returns the number of total union-neighbors for the given node-pair (@a u, @a v).
-     * @param u First node
-     * @param v Second node
-     * @return the number of total union-neighbors for the given node-pair (@a u, @a v)
-     */
-    double runImpl(node u, node v) override {
-        return NeighborhoodUtility::getNeighborsUnion(*G, u, v).size();
-    }
-
-public:
-    using LinkPredictor::LinkPredictor;
-};
-
-} // namespace NetworKit
-
-#endif // NETWORKIT_LINKPREDICTION_TOTAL_NEIGHBORS_INDEX_HPP_

package/vendor/include/networkit/linkprediction/UDegreeIndex.hpp

@@ -1,35 +0,0 @@
-/*
- * UDegreeIndex.hpp
- *
- *  Created on: 01.04.2015
- *      Author: Kolja Esders
- */
-
-#ifndef NETWORKIT_LINKPREDICTION_U_DEGREE_INDEX_HPP_
-#define NETWORKIT_LINKPREDICTION_U_DEGREE_INDEX_HPP_
-
-#include <networkit/linkprediction/LinkPredictor.hpp>
-
-namespace NetworKit {
-
-/**
- * @ingroup linkprediction
- *
- * Index that simply returns the degree of the first given node.
- */
-class UDegreeIndex final : public LinkPredictor {
-    /**
-     * Returns the degree of the first node provided, namely @a u.
-     * @param u First node
-     * @param v Second node
-     * @return the degree of the first node provided, namely @a u
-     */
-    double runImpl(node u, node) override { return G->degree(u); }
-
-public:
-    using LinkPredictor::LinkPredictor;
-};
-
-} // namespace NetworKit
-
-#endif // NETWORKIT_LINKPREDICTION_U_DEGREE_INDEX_HPP_

package/vendor/include/networkit/linkprediction/VDegreeIndex.hpp

@@ -1,35 +0,0 @@
-/*
- * VDegreeIndex.hpp
- *
- *  Created on: 01.04.2015
- *      Author: Kolja Esders
- */
-
-#ifndef NETWORKIT_LINKPREDICTION_V_DEGREE_INDEX_HPP_
-#define NETWORKIT_LINKPREDICTION_V_DEGREE_INDEX_HPP_
-
-#include <networkit/linkprediction/LinkPredictor.hpp>
-
-namespace NetworKit {
-
-/**
- * @ingroup linkprediction
- *
- * Index that simply returns the degree of the second given node.
- */
-class VDegreeIndex final : public LinkPredictor {
-    /**
-     * Returns the degree of the second node provided, namely @a v.
-     * @param u First node
-     * @param v Second node
-     * @return the degree of the second node provided, namely @a v
-     */
-    double runImpl(node, node v) override { return G->degree(v); }
-
-public:
-    using LinkPredictor::LinkPredictor;
-};
-
-} // namespace NetworKit
-
-#endif // NETWORKIT_LINKPREDICTION_V_DEGREE_INDEX_HPP_

package/vendor/include/networkit/matching/BMatcher.hpp

@@ -1,52 +0,0 @@
-/*
- * BMatcher.hpp
- *
- *  Created on: 07.08.2023
- *      Author: Fabian Brandt-Tumescheit
- *              Frieda Gerharz
- */
-
-#ifndef NETWORKIT_MATCHING_B_MATCHER_HPP_
-#define NETWORKIT_MATCHING_B_MATCHER_HPP_
-
-#include <networkit/base/Algorithm.hpp>
-#include <networkit/matching/BMatching.hpp>
-
-namespace NetworKit {
-
-/**
- * @ingroup matching
- * Base class for b-matching algorithms.
- */
-class BMatcher : public Algorithm {
-protected:
-    const Graph *G;
-    BMatching bMatch;
-
-public:
-    /**
-     * Constructs a new BMatcher.
-     *
-     * @param G The graph to compute the b-matching on.
-     * @param b A vector of b-values for all nodes in the graph.
-     */
-    BMatcher(const Graph &G, const std::vector<count> &b);
-
-    ~BMatcher() override = default;
-
-    /**
-     * Runs the b-matching algorithm on the stored graph.
-     *
-     */
-    void run() override = 0;
-
-    /**
-     * Gets the b-matching for the stored graph.
-     * Note: The b-matching is only valid, if the corresponding algorithm
-     * has taken care of populating it properly.
-     */
-    BMatching getBMatching() const;
-};
-
-} /* namespace NetworKit */
-#endif // NETWORKIT_MATCHING_B_MATCHER_HPP_

package/vendor/include/networkit/matching/BMatching.hpp

@@ -1,115 +0,0 @@
-/*
- * BMatching.hpp
- *
- *  Created on: 07.08.2023
- *      Author: Fabian Brandt-Tumescheit
- *              Frieda Gerharz
- */
-
-#ifndef NETWORKIT_MATCHING_B_MATCHING_HPP_
-#define NETWORKIT_MATCHING_B_MATCHING_HPP_
-
-#include <unordered_set>
-#include <networkit/auxiliary/Log.hpp>
-#include <networkit/graph/Graph.hpp>
-
-namespace NetworKit {
-
-/**
- * @ingroup b-matching
- */
-class BMatching {
-
-public:
-    /**
-     * @brief WARNING: This contructor is required for Python and should not be used as the
-     * BMatching is not correctly initialized.
-     *
-     */
-    BMatching() = default;
-
-    /**
-     * Constructs a new BMatching.
-     *
-     * @param G The graph
-     * @param b b values for all nodes
-     */
-    BMatching(const Graph &G, const std::vector<count> &b);
-
-    /**
-     * Checks whether this is a proper b-matching.
-     *
-     * @return bool
-     */
-    bool isProper() const;
-
-    /**
-     * Sets two nodes @a u and @a v as each others matching NodeMatches.
-     *
-     * @param u
-     * @param v
-     */
-    void match(node u, node v);
-
-    /**
-     * Resets the two nodes @a u and @a v to unmatched.
-     *
-     * @param u
-     * @param v
-     */
-    void unmatch(node u, node v);
-
-    /**
-     * Checks if node is unmatched.
-     *
-     * @param u
-     * @return bool
-     */
-    bool isUnmatched(node u) const;
-
-    /**
-     * Checks if the two nodes @a u and @a v are matched together.
-     *
-     * @param u node.
-     * @param v node.
-     * @return bool
-     */
-    bool areMatched(node u, node v) const;
-
-    /**
-     * Get the number of edges in this b-matching.
-     *
-     * @return Number of edges in b-matching.
-     */
-    count size() const;
-
-    /**
-     * Get total weight of edges in this b-matching.
-     *
-     * @return edgeweight
-     */
-    edgeweight weight() const;
-
-    /**
-     * Retrieves a reference to the set of matches for each node.
-     */
-    const std::vector<std::unordered_set<node>> &getMatches() const;
-
-    /**
-     * Retrieves the b-value for each node.
-     */
-    const std::vector<count> &getB() const;
-
-    /**
-     * Removes all entries from the b-matching data structure
-     */
-    void reset();
-
-protected:
-    const Graph *G;
-    std::vector<count> b;
-    std::vector<std::unordered_set<node>> matches;
-};
-
-} /* namespace NetworKit */
-#endif // NETWORKIT_MATCHING_B_MATCHING_HPP_

package/vendor/include/networkit/matching/BSuitorMatcher.hpp

@@ -1,170 +0,0 @@
-/*
- * BSuitorMatcher.hpp
- *
- *  Created on: 07.08.2023
- *      Author: Fabian Brandt-Tumescheit
- *              Frieda Gerharz
- */
-
-#ifndef NETWORKIT_MATCHING_B_SUITOR_MATCHER_HPP_
-#define NETWORKIT_MATCHING_B_SUITOR_MATCHER_HPP_
-
-#include <algorithm>
-#include <ranges>
-
-#include <networkit/graph/Graph.hpp>
-#include <networkit/matching/BMatcher.hpp>
-
-namespace NetworKit {
-
-/**
- * @ingroup matching
- * B-Suitor matching finding algorithm.
- */
-class BSuitorMatcher : public BMatcher {
-protected:
-    struct MatchingNode {
-        node id;
-        edgeweight weight;
-
-        MatchingNode() : id(none), weight(0) {}
-        MatchingNode(node n, edgeweight w) : id(n), weight(w) {}
-
-        // If the edgeweight is the same for two MatchingNodes
-        // then we compare the node id, where a smaller id is
-        // ranked higher.
-        std::partial_ordering operator<=>(const MatchingNode &other) const {
-            if (auto cmp = weight <=> other.weight; cmp != 0)
-                return cmp;
-
-            return -static_cast<int64_t>(id) <=> -static_cast<int64_t>(other.id);
-        }
-
-        bool operator==(const MatchingNode &other) const = default;
-    };
-
-    struct MatchingNodeInfo {
-        std::vector<MatchingNode> partners;
-        MatchingNode min; // (none, 0) if partners still has free capacity
-        count max_size;
-
-        MatchingNodeInfo() = default;
-
-        MatchingNodeInfo(count b) {
-            partners.reserve(b);
-            max_size = b;
-        }
-
-        bool hasPartner(node u) const {
-            return std::ranges::find_if(partners, [u](const MatchingNode &v) { return v.id == u; })
-                   != partners.end();
-        }
-
-        MatchingNode popMinIfFull() {
-            if (partners.size() < max_size) {
-                return {none, 0};
-            } else {
-                MatchingNode min_copy = min;
-                remove(min.id);
-                return min_copy;
-            }
-        }
-
-        MatchingNode insert(const MatchingNode &u) {
-            if (hasPartner(u.id))
-                return {none, 0};
-
-            MatchingNode prevMin = popMinIfFull();
-
-            partners.emplace_back(u);
-            if (partners.size() == max_size && !partners.empty()) {
-                min = *std::ranges::min_element(partners);
-            }
-            return prevMin;
-        }
-
-        void remove(node u) {
-            partners.erase(std::remove_if(partners.begin(), partners.end(),
-                                          [u](const MatchingNode &v) { return v.id == u; }),
-                           partners.end());
-            min = MatchingNode();
-        }
-    };
-
-public:
-    /**
-     * Computes a 1/2-approximate maximum weight b-matching of an undirected weighted Graph @c G
-     * using the sequential b-Suitor algorithm published by Khan et al. in "Efficient Approximation
-     * Algorithms For Weighted B-Matching", SIAM Journal on Scientific Computing, Vol. 38, Iss. 5
-     * (2016).
-     *
-     * @param G An undirected graph.
-     * @param b A vector of @a b values that represents the max number of edges per vertex @a v in
-     * the b-Matching (b.at(v)).
-     */
-    BSuitorMatcher(const Graph &G, const std::vector<count> &b);
-
-    /**
-     * @param G An undirected graph.
-     * @param b A value @a b that represents the max number of edges per vertex in the b-Matching.
-     * Defaults to the ordinary 1-Matching.
-     */
-    BSuitorMatcher(const Graph &G, count b = 1);
-
-    ~BSuitorMatcher() override = default;
-
-    /**
-     * Runs the algorithm.
-     */
-    void run() override;
-
-    /**
-     * Creates the b-matching for given graph G. Function run() automatically invokes
-     * buildMatching. After invoking buildBMatching(), use getBMatching() to retrieve the resulting
-     * b-matching.
-     */
-    void buildBMatching();
-
-protected:
-    std::vector<MatchingNodeInfo> suitors;
-    std::vector<MatchingNodeInfo> proposed;
-    const std::vector<count> b;
-
-    /**
-     * Iterates up to @a b times over the heaviest neighbors of node @a u and makes
-     * them to suitors if eligible.
-     *
-     * @param u
-     */
-    void findSuitors(node u);
-
-    /**
-     * Finds the heaviest unmatched neighbor that @a u has not yet proposed to
-     * if it exists. For equally weighted edges w(u, t), w(u, v) and t < v, w(u, t) is considered
-     * smaller than w(u, v) to break ties.
-     *
-     * @param y
-     * @return Node
-     */
-    MatchingNode findPreferred(node u);
-
-    /**
-     * Makes @a v a suitor of @a u and recursively calls itself for previous worse
-     * suitors of @a u that got replaced with their new best match.
-     *
-     * @param u
-     * @param w
-     * @param v
-     */
-    void makeSuitor(node u, edgeweight w, node v);
-
-    /**
-     * Checks the symmetry of pairs of nodes. It must hold that v is in suitors(u) iff u is
-     * in suitors(v).
-     *
-     */
-    bool isSymmetrical() const;
-};
-} // namespace NetworKit
-
-#endif // NETWORKIT_MATCHING_B_SUITOR_MATCHER_HPP_

package/vendor/include/networkit/matching/DynamicBSuitorMatcher.hpp

@@ -1,78 +0,0 @@
-/*
- * DynamicBSuitorMatcher.hpp
- *
- *  Created on: 06.01.2025
- *      Author: Fabian Brandt-Tumescheit
- *              Frieda Gerharz
- */
-
-#ifndef NETWORKIT_MATCHING_DYNAMIC_B_SUITOR_MATCHER_HPP_
-#define NETWORKIT_MATCHING_DYNAMIC_B_SUITOR_MATCHER_HPP_
-
-#include <set>
-#include <unordered_map>
-#include <networkit/auxiliary/Log.hpp>
-#include <networkit/base/DynAlgorithm.hpp>
-#include <networkit/matching/BSuitorMatcher.hpp>
-
-namespace NetworKit {
-class DynamicBSuitorMatcher final : public BSuitorMatcher, public DynAlgorithm {
-    enum class Operation { Insert, Remove };
-
-public:
-    /**
-     * Implementation from the algorithm from "A Fully-dynamic Approximation Algorithm for Maximum
-     * Weight b-Matchings in Graphs" from Proceedings of The Thirteenth International Conference on
-     * Complex Networks and their Applications 2024 by Fabian Brandt-Tumescheit, Frieda Gerharz and
-     * Henning Meyerhenke. The algorithm dynamically updates the b-matching based on the b-Suitor
-     * algorithm by Khan et al. The solution is the same as a complete recomputation of the b-Suitor
-     * b-matching.
-     *
-     * @param   G	The graph,
-     * @param   b   List of b-values for each node in the graph.
-     */
-    DynamicBSuitorMatcher(const Graph &G, const std::vector<count> &b) : BSuitorMatcher(G, b) {}
-
-    /**
-     * @param   G	The graph,
-     * @param   b   Set the same b-value for all nodes. Optional and defaults to 1.
-     */
-    DynamicBSuitorMatcher(const Graph &G, count b = 1) : BSuitorMatcher(G, b) {}
-
-    /**
-     * Updates the b-matching after an edge insertion or deletion on the graph.
-     * Notice: Supported events include edge insertion and deletion.
-     *
-     * @param e The update event.
-     */
-    void update(GraphEvent e) override;
-
-    /**
-     * Updates the b-matching after a batch of edge insertions or deletions on the graph.
-     * Notice: Supported events include edge insertion and deletion.
-     *
-     * @param e The batch of update events.
-     */
-    void updateBatch(const std::vector<GraphEvent> &batch) override;
-
-private:
-    // helper function
-    bool isBetterMatch(node u, node v, edgeweight ew) const noexcept {
-        const MatchingNode currentMatch = suitors[u].min;
-        return currentMatch.id == none || currentMatch.weight < ew
-               || (currentMatch.weight == ew && v < currentMatch.id);
-    }
-
-    void addEdge(const GraphEvent &event);
-
-    void processEdgeInsertion(const GraphEvent &event);
-
-    void removeEdge(const GraphEvent &event);
-
-    void processEdgeRemoval(const GraphEvent &event);
-
-    void trackUpdatePath(node start);
-};
-
-} // namespace NetworKit
-#endif // NETWORKIT_MATCHING_DYNAMIC_B_SUITOR_MATCHER_HPP_

package/vendor/include/networkit/matching/LocalMaxMatcher.hpp

@@ -1,35 +0,0 @@
-/*
- * LocalMaxMatcher.hpp
- *
- *  Created on: 05.12.2012
- *      Author: Christian Staudt
- */
-
-#ifndef NETWORKIT_MATCHING_LOCAL_MAX_MATCHER_HPP_
-#define NETWORKIT_MATCHING_LOCAL_MAX_MATCHER_HPP_
-
-#include <networkit/graph/Graph.hpp>
-#include <networkit/matching/Matcher.hpp>
-
-namespace NetworKit {
-
-/**
- * @ingroup matching
- * LocalMax matching similar to the one described in the EuroPar13 paper
- * by the Sanders group (Birn, Osipov, Sanders, Schulz, Sitchinava)
- */
-class LocalMaxMatcher final : public Matcher {
-public:
-    /**
-     * @param G Undirected graph with for which the matching is computed.
-     */
-    LocalMaxMatcher(const Graph &G);
-
-    /**
-     * Runs the algorithm.
-     */
-    void run() override;
-};
-
-} /* namespace NetworKit */
-#endif // NETWORKIT_MATCHING_LOCAL_MAX_MATCHER_HPP_