Skip to content
View DylanWeeks2's full-sized avatar

Block or report DylanWeeks2

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
DylanWeeks2/README.md

Projects:

Project Description
Game-Engine: This project is the C++ game engine that is used to make all my other personal projects and games. This game engine contains a DirectX 11 rendering pipeline, a 2D/3D math and physics library, and systems for important gameplay functionality such as audio, input, events, etc.
A-BFS-DFS-Dijkstra: This is a program that analyzes the performance for the search algorithms of A*, BFS, DFS, Dijkstra.
Travelling-salesman-problem-Brute-Force-vs-Dynamic-Programming This program solves the traveling salesman problem using brute force and dynamic programming. There is a report is attached comparing and contrasting these two algortihms.
Traveling-salesman-problem-Genetic-Algorithm-vs-Tabu Solves the traveling salesman problem using the genetic algorithm and tabu methods. A report is attached comparing and contrasting these two algortihms.
Smurf-Programming-Language This project is a custom programming language that is capable of supporting functions, closures, recursion, bound variables, conditional logic, and integer arithmetic. This custom language was created using Python.

Pinned Loading

  1. Game-Engine Game-Engine Public

    This project is the C++ game engine that is used to make all my other personal projects and games. This game engine contains a DirectX 11 rendering pipeline, a 2D/3D math and physics library, and s…

    C++

  2. A-BFS-DFS-Dijkstra A-BFS-DFS-Dijkstra Public

    This is a program that analyzes the performance for the search algorithms of A*, BFS, DFS, and Dijkstra.

    C++

  3. Travelling-salesman-problem-Brute-Force-vs-Dynamic-Programming- Travelling-salesman-problem-Brute-Force-vs-Dynamic-Programming- Public

    This program solves the traveling salesman problem using brute force and dynamic programming.

    C++

  4. Traveling-salesman-problem-Genetic-Algorithm-vs-Tabu- Traveling-salesman-problem-Genetic-Algorithm-vs-Tabu- Public

    Solves the traveling salesman problem using the genetic algorithm and tabu methods.

    C++