Master repository for the JGraphT project

A high-performance library for graph algorithms written in Java. It contains a wide collection of optimized algorithms and data structures for a range of problems on graphs.

Multi-Purpose support library developed during my PhD. It's always Work-In-Progress.

turn images into navigable graphs and find the best path between 2 points using graph theory algorithms. Made for my year conclusion project, for IFPR Campus Cascavel

Implementation of different algorithms and data structures in Java.

🔍 This repository explores the graph data structure, focusing on its application in analyzing large texts and developing the Word Graph Game. It includes algorithms for text analysis, graph construction, and game logic, offering a comprehensive toolkit for educational and development purposes.

Java implementation of a graph-based algorithm to decide if a message can be decoded from a box grid with single-use keys. The solution models dependencies and uses topological sorting to ensure a valid opening order.

Java implementation of a graph-based algorithm to decide if a message can be decoded from a box grid with single-use keys. The solution models dependencies and uses topological sorting to ensure a valid opening order.

Java program that finds the shortest route between U.S. cities using Dijkstra’s algorithm and graph-based data structures.

Java maze solving using graph representations and DFS with coin-based door unlocking mechanics. Implements pathfinding with constraints and graph traversal techniques.

上海市旅游景点导游程序 是一个基于Java Swing的智能旅游导览系统，专为优化上海本地及游客的出行体验设计。系统内置30个上海核心景点的详细信息及300+条真实交通网络数据，支持多维查询、动态成本计算及离线运行，为用户提供高效、直观的行程规划工具。

A simple Java library that analyzes dependencies between things and determines a directed graph and layerization of dependencies

This repository is a well-structured collection of Data Structures and Algorithms (DSA) in Java. It provides optimized code, detailed notes, and hands-on problem-solving exercises to help developers and students master DSA concepts effectively.

A graphtea shell version

This is an implementation of the ford fulkerson algorithm that is used to get the maxflow and mincuts of a network with edge capacities.

"Match the initial knight board position to it's final board position"

A graph-based social network for movie recommendations. Built as final project for the Data structures & Algorithms course in university.

A JavaFX-based tool for visualizing, editing, and minimizing DFAs (Deterministic Finite Automata), enabling users to efficiently create, optimize, and work with state machines in a user-friendly interface.

Welcome to Megazoo Inc. One of the world's leading zoo owners, animal rehabilitation experts, and proud record holder of “Biggest Zoo on the Planet”. As you might imagine, when working with zoos that have up to 15 000 enclosures (yes, that’s right), it can be quite tricky to feed all the animals with the limited number of zookeepers.

This project contains the implementation of basic graph theory algorithms like BFS, DFS, Kruskal's MST, Prim's MST, Dijkstras Shortest Path