Master repository for the JGraphT project

make your own graph for different algorithms

A simple graph editor built for a university software engineering project.

Java based demonstration of Depth First Search algorithm on an undirected graph using HTML5 Canvas, Javascript and AJAX.

This project creates word ladders in directed and undirected graph generated from the words in the text file sub-words. It then finds the strongly connected components in the directed graph.

This repo contains utilities like DFS, BFS and connected components. Using them you can validate if there exists a path between vertices and find it too. You can also find shortest path between two vertices of graph using these classes.

An unsophisticated graph library that supports creating directed or undirected graphs with custom weights. There is the option to choose between an adjacency matrix or list. This application was built for educational purposes.

This project implements the solution to find the Minimum Spanning Tree (MST) of an undirected graph using Prim's algorithm.

A collection of graph algorithms

pbGraphs is a graph library for Java

Maze solver using depth-first search algorithm

This is a school project from Data Structures and Algorithms course where graphs, Prim's Algorithm and Dijkstra's Algorithm are used effectively. It is an application of finding shortest path and minimum spanning tree on graphs. The project is thematized with legendary love story of Leyla and Mecnun. The aim of the project is brought together Le…

Graphical application to solve and show case undirected graphs. Includes a physics-based simulation to display vertices and edges. Written in pure Java.

Java based animated demonstration of Depth First Search algorithm applied to find the connected components of an undirected graph

practice the understanding of Undirected Graphs and Adjacency Lists.