📈 Graph Algorithms, Bitmasking & Trie – Learning Repository

A curated collection of **graph algorithm implementations**, **bitmasking techniques**, and **trie / prefix-tree structures** in C++. This repo is built for learners who want to go deeper into algorithmic tools used in contests, interviews, and advanced problem solving.

---

📌 Overview

This repository contains:

• Graph algorithms (shortest paths, MST, DFS/BFS, etc.)
• Bitmasking & state compression techniques for subsets, DP on bitmasks
• Trie / prefix tree implementations & related string / prefix problems
• Clean, commented C++ code examples and challenge problems
• Structured progression to help learners build up complexity

---

🧭 Folder Structure

Graph-Algorithm-Bitmasking-and-Trie/
├── 01_Graphs/
│   ├── bfs.cpp
│   ├── dfs.cpp
│   ├── dijkstra.cpp
│   ├── mst_kruskal.cpp
│   └── ...
│
├── 02_Bitmasking/
│   ├── bitmask_dp_subset.cpp
│   ├── bitmask_tricks.cpp
│   └── ...
│
├── 03_Trie/
│   ├── trie_insert_search.cpp
│   ├── trie_with_count.cpp
│   ├── prefix_queries.cpp
│   └── ...
│
└── README.md