Graph.hpp

Go to the documentation of this file.

 
#ifndef GRAPH_H
#define GRAPH_H
 
#include <string>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <mutex>
#include <memory>
#include <shared_mutex>
#include <utility>
#include "absl/container/flat_hash_map.h"
 
#include <utility> // For std::pair
 
struct PairHash {
    template <class T1, class T2>
    size_t operator()(const std::pair<T1, T2>& p) const noexcept {
        return absl::HashOf(p.first, p.second);
    }
};
 
class Graph {
public:
    Graph() = default;
 
    void load_graph(const std::string& filepath);
 
    const std::vector<int>& get_neighbors(int node) const;
 
    void add_node(int node);
 
    void delete_node(int node);
 
void save_graph(const std::string& filename) const;
 
private:
    absl::flat_hash_map<int, std::shared_ptr<const std::vector<int>>> adj_list;  
    static const std::vector<int> static_empty_vector; // Single shared instance
    mutable std::shared_mutex adj_list_mutex; // Thread-safe access control
 
 
    bool validate_filepath(const std::string& path) const;
};
 
#endif // GRAPH_H