Skip to content
#

subgraph-matching

Here are 18 public repositories matching this topic...

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

  • Updated Feb 20, 2022
  • JavaScript

Improve this page

Add a description, image, and links to the subgraph-matching topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the subgraph-matching topic, visit your repo's landing page and select "manage topics."

Learn more