Data Structure codes implemented in C

Code to all the graph related concepts.

Graph Algorithm Implementation in JavaScript

Your one-stop GitHub repo for competitive coding and data structures! 🤖 Curated notes, practice problems, and real-world applications. Sharpen your skills and ace those interviews! 💻🔥

♨️ Data structures, algorithms and problem solving patterns using JavaScript.

Data Structure & Algorithm 4th Sem

Maze is a demo to see different graph traversal algorithms in action.

A visualisation React app to view the nature of Graph algorithms on the obstructed 2D grid, implemented bunch of maze generation algorithms and path finding algorithms. Algorithms Implemented: Dijkstra, Depth first search, Modified Recursive Backtracking.

Just for learning purpose

Depth-First Search (DFS: Useful for cycle detection, topological sort, and maze-solving) and Breadth-First Search (BFS: Good for shortest path in unweighted graphs) implementation with python.

You must move your ant colony from one point to another in the least amount of time. Through this project, you will explore graph traversal algorithms: your program will have to choose the paths and moves to be taken by the ants.

Graph Traversal and Dependency Injection using Guice Example

Implemented Breadth First Search (BFS) algorithm when traversing through tree or graph data structures when searching for the nearest hospital in a locality map

🚰 Signal Grid is a vanilla TypeScript game inspired by classic pipe puzzles. The goal is to connect a starting point to an endpoint by rotating pipe-like elements to create a continuous flow. This project was built as a fun challenge to explore game development in TypeScript while implementing puzzle logic and grid-based mechanics.

A desktop GUI application for graph traversal visualization using a maze solver made in Java. Developed as the final project for Object Oriented Programming course at Binus University Malang.

lem_in is a project focused on data structures and graph traversal algoritms.

Java assignment on graph traversal for finding information related to components of a graph and implementing a generic sorting function with O(n log n) time complexity which works for any comparable data-type.

Given a text file of satellite deployment information, provide a topologically sorted subset of those deployments for the purpose of monetary optimization over a series of launches over time.

Graph Traversals