feat: Add links to problem examples

ProvideQ · Sep 3, 2024 · 7ad983b · 7ad983b
1 parent f6668c1
commit 7ad983b
Show file tree

Hide file tree

Showing 4 changed files with 42 additions and 8 deletions.
diff --git a/src/pages/solve/FeatureModelAnomaly.tsx b/src/pages/solve/FeatureModelAnomaly.tsx
@@ -1,4 +1,4 @@
-import { Heading, ListItem, Text, UnorderedList } from "@chakra-ui/react";
+import { Heading, Link, ListItem, Text, UnorderedList } from "@chakra-ui/react";
 import { NextPage } from "next";
 import { useState } from "react";
 import { Option } from "react-multi-select-component";
@@ -26,7 +26,15 @@ const FeatureModelAnomaly: NextPage = () => {
       <Text color="text" align="justify">
         For a tree of features with cross tree constraints, these solvers can
         detect various anomalies. Feature Models are given in the extended
-        Universal Variablity Language (UVL).
+        Universal Variablity Language (UVL). You can find information about UVL
+        and feature model examples{" "}
+        <Link
+          href="https://universal-variability-language.github.io"
+          color={"blue.400"}
+        >
+          here
+        </Link>
+        .
       </Text>
 
       <UnorderedList>

diff --git a/src/pages/solve/MaxCut.tsx b/src/pages/solve/MaxCut.tsx
@@ -27,14 +27,25 @@ const MaxCut: NextPage = () => {
         For a given weighted graph, this algorithm finds a partition of the
         graph so that the sum of edge weights <i>between</i> these partitions is
         maximal. The graph can be specified in the{" "}
-        <Link href="https://en.wikipedia.org/wiki/Graph_Modelling_Language">
+        <Link
+          href="https://en.wikipedia.org/wiki/Graph_Modelling_Language"
+          color={"blue.400"}
+        >
           Graph Modeling Language
         </Link>{" "}
         and edge weights can be specified with the <Code>weight</Code>{" "}
         properties. If the <Code>weight</Code> property is omitted, a weight of
         <Code>1</Code> units is used implicitly. All solvers will return a graph
         (in the GML format) with the same node <Code>id</Code>s, where each node
-        has a <Code>partition</Code> value assigned.
+        has a <Code>partition</Code> value assigned. Example MaxCut problems can
+        be found{" "}
+        <Link
+          href="https://github.com/ProvideQ/maxcut-problems"
+          color={"blue.400"}
+        >
+          here
+        </Link>
+        .
       </Text>
 
       <Spacer />

diff --git a/src/pages/solve/TSP.tsx b/src/pages/solve/TSP.tsx
@@ -1,4 +1,4 @@
-import { Heading, Spacer, Text } from "@chakra-ui/react";
+import { Heading, Link, Spacer, Text } from "@chakra-ui/react";
 import type { NextPage } from "next";
 import { useState } from "react";
 import { Layout } from "../../components/layout/Layout";
@@ -15,7 +15,15 @@ const TSP: NextPage = () => {
         The Traveling Salesperson Problem (TSP) is a classic combinatorial
         optimization problem. Given a list of cities and the distances between
         them, the task is to find the shortest possible route that visits each
-        city exactly once and returns to the origin city.
+        city exactly once and returns to the origin city. Example TSP problems
+        can be found{" "}
+        <Link
+          href="https://github.com/ProvideQ/tsp-problems"
+          color={"blue.400"}
+        >
+          here
+        </Link>
+        .
       </Text>
 
       <Spacer />

diff --git a/src/pages/solve/VehicleRouting.tsx b/src/pages/solve/VehicleRouting.tsx
@@ -1,4 +1,4 @@
-import { Heading, Spacer, Text } from "@chakra-ui/react";
+import { Heading, Link, Spacer, Text } from "@chakra-ui/react";
 import type { NextPage } from "next";
 import { useState } from "react";
 import { Layout } from "../../components/layout/Layout";
@@ -16,7 +16,14 @@ const VehicleRouting: NextPage = () => {
         problem that seeks to find the best set of routes for a fleet of
         vehicles to service a set of customers. The problem can be specified in
         the VRP format and all solvers will return a solution in the same
-        format.
+        format. Example VRP problems can be found in the{" "}
+        <Link
+          href="http://vrp.galgos.inf.puc-rio.br/index.php/en"
+          color={"blue.400"}
+        >
+          CVRPLib
+        </Link>
+        .
       </Text>
 
       <Spacer />