Visualizes specific Graph Algorithms like BFS, DFS, MST etc. on interactive user input graphs.

Traverser is a Java library that helps software engineers implement advanced iteration of a data structure.

Solutions for popular algorithms and data structures problems on leetcode

GraphLab is an application that shows visually how several graph algorithms work

Pathfinding Visualizer application that visualizes graph based search algorithms used to find the shortest path. Algorithms used: Breadth first search, Depth first search, Best first search and A* search made with java swing

Set of Patterns to solve many algorithmic questions of similar type on LeetCode

This repo is having leetcode problems solution with explaination and also having the link to problems along with resources to learn and practice

Fundamental computer science algorithms and preparation for computing contests.

Breadth First Search & Depth First Search graph algorithms

a Java AI agent to play board game ticket to ride

Implementation of various complex algorithms that are graph related and used in the real world applications.

LeetCode, HackerRank, Codility, CTCI - Cracking The Coding Interview & Miscellaneous algorithms and data structures studies & solutions

Freecell solitaire Solver Project for Artificial Intelligence course from University of Macedonia

Network Flow: Given a directed graph with edge capacities and vertex demands, is there a circulation of flow?

Searching Visualization in a Graph using A* and BFS Algorithms. Imported GraphStream library for the GUI.

Here are some of my Data structures and algorithms created in Java Programming Language using IntelliJ IDE.

Utilizing graph traversal (depth-first search and Dijkstra's algorithms) to navigate the shortest path through highways between cities given their coordinates.

🌽 Maze Generation & Solver - Automatically generates a maze and solves the maze using Breadth-First Search (BFS) and Depth-First Search (DFS)

✈️ Flight route planning agent using classic AI search algorithms (A*, Best-First, DFS, BFS).