From e12d4832aefe4dc19fc937661e0913276b53f128 Mon Sep 17 00:00:00 2001
From: Pratham Khanal <pkprathamkhanal@gmail.com>
Date: Wed, 19 Nov 2025 08:34:56 -0600
Subject: [PATCH 1/5] Update CLIQUE_Class.cs

Add contributorsLink field to link to About Us page
---
 Problems/NPComplete/NPC_CLIQUE/CLIQUE_Class.cs | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/Problems/NPComplete/NPC_CLIQUE/CLIQUE_Class.cs b/Problems/NPComplete/NPC_CLIQUE/CLIQUE_Class.cs
index 122d0124..b8ee98ba 100644
--- a/Problems/NPComplete/NPC_CLIQUE/CLIQUE_Class.cs
+++ b/Problems/NPComplete/NPC_CLIQUE/CLIQUE_Class.cs
@@ -27,6 +27,8 @@ class CLIQUE : IGraphProblem<CliqueBruteForce,CliqueVerifier,cliqueDefaultVisual
     public cliqueDefaultVisualization defaultVisualization { get; } = new cliqueDefaultVisualization();
     public UtilCollectionGraph graph { get; set; }
     public string[] contributors {get;} = { "Kaden Marchetti", "Alex Diviney" };
+    public string contributorsLink { get; } = "https://redux.portneuf.cose.isu.edu/aboutus";
+
 
     // --- Properties ---
     public List<string> nodes {
@@ -76,4 +78,4 @@ public CLIQUE(string GInput)
         graph = new UtilCollectionGraph(cliqueGraph["N"], cliqueGraph["E"]);
     }
 
-}
\ No newline at end of file
+}

From 2dd1ab280d09ecce606f9e5b1d7dca80dd8d4879 Mon Sep 17 00:00:00 2001
From: Pratham Khanal <pkprathamkhanal@gmail.com>
Date: Wed, 19 Nov 2025 08:46:48 -0600
Subject: [PATCH 2/5] Update ARCSET_Class.cs

adding hyperlink for now.
---
 Problems/NPComplete/NPC_ARCSET/ARCSET_Class.cs | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/Problems/NPComplete/NPC_ARCSET/ARCSET_Class.cs b/Problems/NPComplete/NPC_ARCSET/ARCSET_Class.cs
index 86c4bdad..4670161a 100644
--- a/Problems/NPComplete/NPC_ARCSET/ARCSET_Class.cs
+++ b/Problems/NPComplete/NPC_ARCSET/ARCSET_Class.cs
@@ -42,6 +42,9 @@ class ARCSET : IGraphProblem<ArcSetBruteForce,ArcSetVerifier,ArcSetDefaultVisual
     public ArcSetDefaultVisualization defaultVisualization { get; } = new ArcSetDefaultVisualization();
 
     public string[] contributors { get; } = { "Alex Diviney" };
+    public string contributorsLink { get; } = "https://redux.portneuf.cose.isu.edu/aboutus";
+
+    
 
     public int K;
 
@@ -61,4 +64,4 @@ public ARCSET(string arcInput)
         graph = new UtilCollectionGraph(arcset["N"], arcset["E"]);
         K = int.Parse(arcset["K"].ToString());
     }
-}
\ No newline at end of file
+}

From 91f7f1b7e1ac45370ce925cafdcad1c81c4acde2 Mon Sep 17 00:00:00 2001
From: Pratham Khanal <pkprathamkhanal@gmail.com>
Date: Wed, 19 Nov 2025 09:23:28 -0600
Subject: [PATCH 3/5] Update TSP_Class.cs

Completed missing metadata fields for the Traveling Salesperson (TSP) problem.

- Added a complete problemDefinition describing the decision version of TSP
- Added formalDefinition clarification for Hamiltonian-cycle interpretation
- Added proper academic source citation from Karp (1972)
- Added sourceLink to the official Wikipedia page
- Added wikiName for frontend linking consistency
- Added contributorsLink field to direct users to the About Us page
- Cleaned up and standardized formatting to match other NP-complete problems

These changes bring the TSP problem entry in line with the metadata standards used across the Redux knowledgebase.
---
 Problems/NPComplete/NPC_TSP/TSP_Class.cs | 18 +++++++++++++++---
 1 file changed, 15 insertions(+), 3 deletions(-)

diff --git a/Problems/NPComplete/NPC_TSP/TSP_Class.cs b/Problems/NPComplete/NPC_TSP/TSP_Class.cs
index 8b388a27..4a50d074 100644
--- a/Problems/NPComplete/NPC_TSP/TSP_Class.cs
+++ b/Problems/NPComplete/NPC_TSP/TSP_Class.cs
@@ -12,9 +12,21 @@ class TSP : IGraphProblem<TSPBruteForce, TSPVerifier, TSPDefaultVisualization, U
     // --- Fields ---
     public string problemName {get;} = "Traveling Salesperson";
     public string problemLink { get; } = "https://en.wikipedia.org/wiki/Travelling_salesman_problem";
-    public string formalDefinition {get;} = "TSP = {<G,k> | G is a weighted graph where there is a path through every vertex whose weights add up to less than k}";
-    public string problemDefinition {get;} = "";
+    public string formalDefinition {get;} = 
+        "TSP = {<G,k> | G is a weighted graph where there exists a Hamiltonian cycle whose total weight is less than k }";
+    public string problemDefinition {get;} =
+        "The Traveling Salesperson Problem (TSP) asks whether there exists a Hamiltonian cycle in a weighted graph G such that the total cost of the tour is less than a given bound k. "
+      + "This decision version of TSP determines if a route exists that visits every vertex exactly once and returns to the start while staying within the weight limit.";
     public string[] contributors {get;} = {"Andrija Sevaljevic"};
+    public string contributorsLink { get; } = "https://redux.portneuf.cose.isu.edu/aboutus";
+    public string source {get;} = 
+        "Karp, Richard M. Reducibility among combinatorial problems. In Complexity of Computer Computations, 1972.";
+    public string sourceLink { get; } = 
+        "https://en.wikipedia.org/wiki/Travelling_salesman_problem";
+    public string wikiName {get;} = "Travelling_salesman_problem";
+    public string[] contributors {get;} = {"Andrija Sevaljevic"};
+    public string contributorsLink { get; } = "https://redux.portneuf.cose.isu.edu/aboutus";
+
     
     public string source {get;} = "";
     private static string _defaultInstance { get; } = "(({New York,Chicago,Denver,Los Angeles,Miami},{({New York,Chicago},790),({New York,Denver},1770),({New York,Los Angeles},2450),({New York,Miami},1280),({Chicago,Denver},1000),({Chicago,Los Angeles},2015),({Chicago,Miami},1370),({Denver,Los Angeles},1015),({Denver,Miami},2060),({Los Angeles,Miami},2745)}),8000)";
@@ -81,4 +93,4 @@ public TSP(string GInput)
 
         graph = new UtilCollectionGraph(tsp["N"], tsp["E"]);
     }
-}
\ No newline at end of file
+}

From 8674021e3ad376f9f1b9b37e12c46879d19ec854 Mon Sep 17 00:00:00 2001
From: Pratham Khanal <pkprathamkhanal@gmail.com>
Date: Wed, 19 Nov 2025 09:32:10 -0600
Subject: [PATCH 4/5] Update SUBSETSUM_Class.cs

Just added contributors link to About Us page for now.
---
 Problems/NPComplete/NPC_SUBSETSUM/SUBSETSUM_Class.cs | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/Problems/NPComplete/NPC_SUBSETSUM/SUBSETSUM_Class.cs b/Problems/NPComplete/NPC_SUBSETSUM/SUBSETSUM_Class.cs
index 32b968e8..1a25af3e 100644
--- a/Problems/NPComplete/NPC_SUBSETSUM/SUBSETSUM_Class.cs
+++ b/Problems/NPComplete/NPC_SUBSETSUM/SUBSETSUM_Class.cs
@@ -16,6 +16,9 @@ class SUBSETSUM : IProblem<SubsetSumBruteForce,SubsetSumVerifier, DummyVisualiza
     public string source {get;} = "Karp, Richard M. Reducibility among combinatorial problems. Complexity of computer computations. Springer, Boston, MA, 1972. 85-103.";
     public string sourceLink { get; } = "https://cgi.di.uoa.gr/~sgk/teaching/grad/handouts/karp.pdf";
     public string[] contributors {get;} = { "Garret Stouffer, Caleb Eardley"};
+    public string contributorsLink { get; } = "https://redux.portneuf.cose.isu.edu/aboutus";
+
+    
     public static string _defaultInstance { get; } = "{{1,7,12,15} : 28}";
     public string defaultInstance {get;} = _defaultInstance;
     public string instance {get;set;} = string.Empty;
@@ -83,4 +86,4 @@ public int getT(string instance) {
     }
 
 
-}
\ No newline at end of file
+}

From b39d50ae2548abeb948d03e48a1c7cf2350257aa Mon Sep 17 00:00:00 2001
From: Pratham Khanal <pkprathamkhanal@gmail.com>
Date: Wed, 19 Nov 2025 10:43:55 -0600
Subject: [PATCH 5/5] Update TSP_Class.cs

Updating error we had in the earlier TSP