AlgosPP

C++ Algorithms Library

Table of Contents

• About the Project
  • Built With
• Installation
• Usage
• Contributing
• License
• Contact
• Sorting Performance

About The Project

AlgosPP is a static library for sorting algorithms, advanced data structures, and graph algorithms.

Features

• AlgosPPSorting
  • basic sorting algorithms
  • introsort algorithm that matches std::sort performance
• AlgosPPDataStructures.lib
  • Van Emde Boas Tree
    • generic
    • outperforms balanced BST std::set (log(n) time complexity) on large number of elements with log(log(n)) time complexity
  • Fibonacci Heap
• AlgosPPGraphBasic.lib
  • Graph Class
  • BFS
  • DFS
  • Topological Sort
  • Strongly Connected Components
  • Bellman Ford Single Source Shortest Paths
• AlgosPPGraphAdv.lib
  • Prims Minimum Spanning Tree
  • Dijkstras Single Source Shortest Paths
  • Floyd Warshall All Pairs Shortest Paths
  • Johnson All Pairs Shortest Paths

Built With

• Google Test
• Cmake

Installation

1. Clone the repo

git clone https://github.com/BrettCleary/DigitCNN

OR

2. Include *.lib

Usage

See unit tests for usage examples.

Contributing

Any contributions you make are greatly appreciated.

1. Fork the Project
2. Create your Feature Branch (git checkout -b feature/AmazingFeature)
3. Commit your Changes (git commit -m 'Add some AmazingFeature')
4. Push to the Branch (git push origin feature/AmazingFeature)
5. Open a Pull Request

License

Distributed under the MIT License. See LICENSE for more information.

Contact

Project Link: https://github.com/BrettCleary/SeqNN

Sorting Performance

Profiling for each sorting algorithm implemented compared to std::sort: