Towel VS C# Algorithms

Towel - Throw in the towel! data structures, algorithms, mathematics, metadata, extensions, console, and more - https://github.com/ZacharyPatten/Towel

PacMan is... a PacMan clone in the console. Get the dots. Dodge the ghosts. It's not intended to be very faithful though. I didn't research the AI of the ghost, I just came up with my own AIs that worked. Here is what I did for the ghost AIs:     - Ghost a: follows you via Dijkstra Path Finding and updates every 6 frames (faster)     - Ghost b: randomly moves and updates every 6 frames (faster)     - Ghost c: follows you via Dijkstra Path Finding and updates every 12 frames (slower)     - Ghost d: randomly moves and updates every 12 frames (slower) Note: for this game I pulled in a reference to my nuget package Towel because it includes generic versions of the Dijkstra Path Finding algorithm.

Can you give an example? BCL covers the most common algorithms and data structures, so...? There's also a whole pack of additional algorithms and data structures by u/ZacharyPatten: https://github.com/ZacharyPatten/Towel

Unit Tests

Source Code

I have a GitHub project with generic data structures and algorithms here: https://github.com/ZacharyPatten/Towel It has 18 of the common comparison-based sorting algorithms.

I don't know specifically what you are looking for, but I have a project called Towel that has generic vectors. If interested: https://github.com/ZacharyPatten/Towel.

https://github.com/ZacharyPatten/Towel/blob/070d454f3fcdc5c632bf68547911718b324cf6ae/Examples/DataStructures/Program.cs#L247

Notice how algorithm #1Pool Tracking is dependent on the range of possible values while algorithm #2 Roll Tracking is not. This means if you have a relatively large range of values, then algorithm #2 is faster, otherwise algorithm #1 is faster. So if you want the most efficient method, you just need to compare those runtime complexities based on the parameters and select the most appropriate algorithm. Here is what my "Next" overload currently looks like: See Source Code Here

Here is an example if interested: https://github.com/ZacharyPatten/Towel/blob/master/Examples/CommandLine/Program.cs All I have to do is add the [Command] attribute onto the methods and call "HandleArguments".

There are a lot of different types of trees and the implementation depends heavily on the problem it solves. GitHub has many C# tree implementations such as this project if you go looking. I wrote a structure similar to a trie where each node contained a Dictionary so I could parse hierarchical paths for a project structure.