Master repository for the JGraphT project

Application of Ford-Fulkerson algorithm to find the maximum matching between 2 sides of a bipartite graph

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

Weighted Directed Graphs - Assignment

A CFG is known as a Single Entry Single Exit (SESE) graph if it only has a single entry node and a single exit node. A problem that arose during researchon static analysis is how to deal with loops in the CFG.

Java based animated demonstration of Dijkstra algorithm applied to build a Shortest Paths Tree on a strongly connected directed graph

# Project - Weighted and undirected graph model - very fast and accurate. Using Hashmaps. 11/2020

Java based step-by-step demonstration of Dijkstra algorithm applied to build a Shortest Paths Tree on a strongly connected directed graph

pbGraphs is a graph library for Java

This project had me use an adjacency matrix to model a weighted digraph representing the stages of a project. Given input for a graph, this program calculates a project's feasibility, its topological ordering, and the early & late times for the activities(edges) & stages(nodes) of the provided project.

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…

Algorithms on undirected and directed graphs

Algorithms written on Java

Graph Abstract Data Type and Algorithms