Skip to content

This project showcases advanced algorithm implementations in C++, focusing on Set Theory operations, Boolean expression evaluation, and core Graph Algorithms. It's built for learners and developers aiming to strengthen their understanding of algorithm design and computational logic.

Notifications You must be signed in to change notification settings

MahrozSarmad/discreteStructuresProject

Folders and files

NameName
Last commit message
Last commit date

Latest commit

ย 

History

4 Commits
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 

Repository files navigation

Advanced Algorithm Implementations in C++ ๐Ÿš€

This repository features implementations of key Set Theory Operations, a Boolean Expression Evaluator, and essential Graph Algorithms like Prim's, Kruskal's, and Dijkstra's. Designed for efficiency and clarity, it includes:

๐Ÿ“Œ Set Operations (Union, Intersection, Difference, Symmetric Difference) ๐Ÿ” Boolean Logic Evaluator (Infix to Postfix Conversion, Truth Table Generation, Logical Equivalence) ๐Ÿ—๏ธ Graph Algorithms (Minimum Spanning Tree & Shortest Path) A great resource for those interested in algorithm design, data structures, and computational logic.

About

This project showcases advanced algorithm implementations in C++, focusing on Set Theory operations, Boolean expression evaluation, and core Graph Algorithms. It's built for learners and developers aiming to strengthen their understanding of algorithm design and computational logic.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages