This is a html+js project I worked on for DSTG The project contains an algorithm which compares 2 graphs and finds the largest subgraph while also calculating the critical path within it.
This repository contains a JavaScript algorithm designed to compare two graphs and identify the largest subgraph while calculating its critical path. Developed as a project for a course in my master's program, this project delves into discrete structures and graph theory, offering practical insights into graph analysis and optimization
This is a html+js project I worked on for DSTG The project contains an algorithm which compares 2 graphs and finds the largest subgraph while also calculating the critical path within it.
This repository contains a JavaScript algorithm designed to compare two graphs and identify the largest subgraph while calculating its critical path. Developed as a project for a course in my master's program, this project delves into discrete structures and graph theory, offering practical insights into graph analysis and optimization