Distributed DAF

Distributed implementation of the DAF (Degree-Aware Filtering) subgraph matching algorithm, adapted from the original sequential C++ implementation for distributed execution on Apache Spark GraphX.

Enables subgraph matching to scale across a cluster by finding all embeddings of a query graph within a larger base graph while respecting vertex labels.

Implemented in three phases: 1. DAG construction using degree-aware heuristics 2. Candidate space building with iterative refinement 3. Backtracking-based embedding enumeration

B.S. thesis project supervised by Dr. Hasan Haghighi at Shahid Beheshti University.