Weighted Directed Graphs - Assignment

A Java-based project that visualizes a traffic management system using graph structures and JavaFX. It demonstrates node and edge representation for traffic flow between locations, providing an interactive and visual approach to understanding connectivity.

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.

This module has some Advanced concepts and Programs related to Graph Theory in Java with program implementations

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

Pokemon Game

My implementation of a not so common challenge: implement an efficient weighted graph traversal algorithm.

comput minimum spanning tree in a weighted graph

a prototype solution for a company experiencing logistic issues related to loading goods and scheduling delivery routes. solution is based on data structures and algorithms.

Graph Algorithms library

the second assignment in Java OOP course.

This Java application is an interactive command-line tool that demonstrates and compares two classic pathfinding algorithms: Dijkstra's algorithm for weighted graphs and Floodfill (Breadth-First Search) for unweighted graphs. The program finds the optimal path between two user-defined points on a 2D grid composed of various terrain types.

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.

data structures projects @ rutgers fall 2021