Skip to content

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 

Repository files navigation

DSTG_CPM_Calc

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.

About

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

Topics

Resources

Stars

3 stars

Watchers

2 watching

Forks

Releases

Packages

Contributors

Languages