Graph.hpp File Reference

High-performance, secure graph library using parallel adjacency lists. More...

#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 dependency graph for Graph.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	PairHash
class	Graph

Detailed Description

High-performance, secure graph library using parallel adjacency lists.

Author

Daniel Ferreto

Version

1.0

Date

2025-03-28

Hardware-optimized graph structure using Abseil's flat_hash_map for O(1) average complexity, SIMD-accelerated parsing, and OpenMP-based parallelism. Features secure memory handling, integer overflow protection, and cache-aware algorithms. Designed for large-scale social network graphs (e.g., Stanford SNAP datasets) with efficient node deletion and batch processing.

Note

Compile with -mavx2 -fopenmp -O3 for optimal performance