Deleted implementations. Why are you looking here 🤫

Author: Matsemann

src/js/maxflow.js

@@ -51,28 +51,6 @@ export function finishAlgorithm(algorithm) {
  * @returns {boolean} If a path was found
  */
 export function breadthFirst(network) {
-    const visited = [];
-    const queue = ["source"];
-
-    while (queue.length !== 0) {
-        const nodeName = queue.shift();
-        const node = network.getNode(nodeName);
-
-        for (let other in node.residuals) {
-            if (!visited.includes(other) && node.residuals[other] > 0) {
-                queue.push(other);
-                visited.push(other);
-
-                const otherNode = network.getNode(other);
-                otherNode.residualParent = nodeName;
-
-                if (other === "sink") { // found it
-                    return true;
-                }
-            }
-        }
-    }
-
     return false;
 }
 
@@ -85,18 +63,7 @@ export function breadthFirst(network) {
  * @returns {number}
  */
 export function findMinResidual(network) {
-    let min = Number.MAX_SAFE_INTEGER;
-    let v = network.getNode("sink");
-    while (v.name !== "source") {
-        let u = network.getNode(v.residualParent);
-        let residual = u.residuals[v.name];
-        if (residual < min) {
-            min = residual;
-        }
-        v = u;
-    }
 
-    return min;
 }
 
 /**
@@ -110,12 +77,5 @@ export function findMinResidual(network) {
  * @param flow
  */
 export function updateResiduals(network, flow) {
-    let v = network.getNode("sink");
-    while (v.name !== "source") {
-        let u = network.getNode(v.residualParent);
 
-        u.residuals[v.name] -= flow;
-        v.residuals[u.name] += flow;
-        v = u;
-    }
 }

src/js/networks/baseball.js

@@ -15,40 +15,7 @@ export const baseball = [
             const {teams, points, remainingGames, upcomingGames} = usaData1; // which case
             const team = 4; // which team nr are we checking can win?
 
-            // calculate our team's theoretical max score
-            const maxScore = points[team] + remainingGames[team];
-
-            // how many wins can the other teams then have?
-            const maxWins = [];
-            for (let i = 0; i < points.length; i++) {
-                maxWins[i] = maxScore - points[i];
-            }
-
-            // Make nodes for the teams, limiting their number of wins
-            for (let i = 0; i < teams.length; i++) {
-                if (i === team) continue;
-                net.createNode(teams[i]);
-                net.createEdge(teams[i], "sink", maxWins[i]);
-            }
-
-            // Try to assign a winner to each game
-            for (let i = 0; i < teams.length; i++) {
-                if (i === team) continue;
-
-                for (let j = i + 1; j < teams.length; j++) {
-                    if (j === team) continue;
-                    const gamesBetween = upcomingGames[i][j];
-                    if (gamesBetween === 0) {
-                        continue;
-                    }
-
-                    const gameName = teams[i] + " vs. " + teams[j];
-                    net.createNode(gameName);
-                    net.createEdge("source", gameName, gamesBetween);
-                    net.createEdge(gameName, teams[i], 99);
-                    net.createEdge(gameName, teams[j], 99);
-                }
-            }
+            // Implement net
 
             return net;
         }

src/js/networks/movieplanning.js

@@ -2,7 +2,6 @@ import {FlowNetwork} from "../network";
 
 /**
  * IMPLEMENT
- *
  */
 export const movieplanning = [
     {
@@ -12,30 +11,7 @@ export const movieplanning = [
 
             const {scenes, days, actors} = dieHardData;
 
-            // Add the days
-            days.forEach(day => {
-                net.createNode(day);
-                net.createEdge(day, "sink", 1);
-            });
-
-            scenes.forEach(scene => {
-                // Add scene
-                net.createNode(scene.name);
-                net.createEdge("source", scene.name, scene.daysToPractice);
-
-                // Only add edge to days where all actors are available
-                days.forEach(day => {
-                    for (let i = 0; i < scene.actors.length; i++) {
-                        let actorName = scene.actors[i];
-                        if (!actors[actorName].includes(day)) {
-                            return;
-                        }
-                    }
-                    // If we reach here all actors are available that day
-                    net.createEdge(scene.name, day, 1);
-                })
-
-            });
+            // Implement net
 
             return net;
         }

src/js/networks/twists.js

@@ -11,21 +11,7 @@ export const twists = [{
     generateNetwork: () => {
         const net = new FlowNetwork();
 
-        data.twists.forEach(twist => {
-            net.createNode(twist.name);
-            net.createEdge(twist.name, "sink", twist.amount);
-        });
-
-        data.people.forEach(person => {
-            net.createNode(person.name);
-            net.createEdge("source", person.name, data.maxTwistsPerPerson);
-
-            person.wishes.forEach(wish => {
-                net.createEdge(person.name, wish.twist, wish.amount);
-            })
-
-        });
-
+        // Implement
 
         return net;
     }