AppGraph.h

Go to the documentation of this file.

 
 
#ifndef APP_GRAPH_H
#define APP_GRAPH_H
 
#include <memory>
#include <string>
#include <vector>
#include <unordered_set>
#include "Escape/Graph.h"
 
struct LabelIndex {
    int max_label = -1;
    std::vector<size_t> nlf_offsets;
    std::vector<int> nlf_label, nlf_count;
};
 
class AppGraph {
public:
    Escape::CGraph* c_graph = nullptr;
    std::vector<int> original_node_ids;
    std::vector<int> fast_node_to_idx;
    std::vector<int> fast_labels;
    std::shared_ptr<const LabelIndex> label_index;
 
    void buildLabelIndex();
    AppGraph() = default;
    ~AppGraph();
    AppGraph(const AppGraph& other);
    AppGraph& operator=(const AppGraph& other);
    AppGraph(AppGraph&& other) noexcept;
    AppGraph& operator=(AppGraph&& other) noexcept;
 
    inline int get_node_idx(int node_id) const {
        if (node_id >= 0 && static_cast<size_t>(node_id) < fast_node_to_idx.size()) {
            return fast_node_to_idx[node_id];
        }
        return -1;
    }
 
    inline int get_label_fast(int node_id) const {
        if (node_id >= 0 && static_cast<size_t>(node_id) < fast_labels.size()) {
            return fast_labels[node_id];
        }
        return -1;
    }
 
    bool readFromFile(const std::string& filepath);
 
    bool buildFromLabelsAndEdges(const std::vector<int>& vertex_labels,
                                 const std::vector<std::pair<int, int>>& edges);
 
    int degree(int node_id) const;
    bool hasEdge(int u, int v) const;
    std::vector<int> getNeighbors(int node_id) const;
 
    static AppGraph createSubgraph(const AppGraph& original, const std::unordered_set<int>& node_subset);
    static AppGraph createSubgraph(const AppGraph& original, const std::vector<int>& sorted_ids);
 
private:
    void build(const std::vector<int>& vertex_ids, const std::vector<int>& vertex_labels,
               const std::vector<std::pair<int, int>>& edges);
    void clear();
    void copy_from(const AppGraph& other);
};
 
#endif