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.
-
Notifications
You must be signed in to change notification settings - Fork 0
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
ilijavuk/Subgraph-and-critical-path-method-calculator
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
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
Watchers
Forks
Releases
No releases published
Packages 0
No packages published