From 353473f1dff2da399e5a932c4e2cc4395ea95c28 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Johanna=20S=C3=A4nger?= Date: Fri, 19 Aug 2022 14:45:19 +0300 Subject: [PATCH 1/3] Export gradable property from JSAV-min.js Export the gradable property from the JSAV in the player test bench as well. Now it records correct JAAL 2.0. --- testbench/OpenDSA/JSAV/build/JSAV-min.js | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/testbench/OpenDSA/JSAV/build/JSAV-min.js b/testbench/OpenDSA/JSAV/build/JSAV-min.js index 1b650d3..a428ad3 100644 --- a/testbench/OpenDSA/JSAV/build/JSAV-min.js +++ b/testbench/OpenDSA/JSAV/build/JSAV-min.js @@ -482,7 +482,8 @@ var eventData = { "type": action, "currentStep": that.currentStep(), - "totalSteps": that.totalSteps() + "totalSteps": that.totalSteps(), + "gradable": that._undo[that._undo.length - 1].options.grade ?? false, }; that.logEvent(eventData); } From 0905ffb126b9724cd2b6c8067976b90b2381bc58 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Johanna=20S=C3=A4nger?= Date: Fri, 16 Sep 2022 12:52:52 +0300 Subject: [PATCH 2/3] Initial working JAAL 2.0 version of player Correctly set initial state from the submission. Flatten modelAnswerSteps and filter on gradable property. --- player.js | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/player.js b/player.js index a805a61..f169dd7 100644 --- a/player.js +++ b/player.js @@ -115,7 +115,7 @@ function initializeAnimationView(submission, detailed) { function initializeModelAnswerView(submission) { const modelAnswer = submission.definitions.modelAnswer; if (modelAnswer.length > 0) { - var initialStateHTML = getModelAnswerInitialHTML(modelAnswer); + var initialStateHTML = submission.initialState.modelSvg; } else { $('#model-answer-container').html('

No model answer data

'); return; @@ -164,8 +164,8 @@ function getModelAnswerInitialHTML(modelAnswer) { * @returns a list of the modelAnswer steps with type click. */ function getModelAnswerSteps(modelAnswer) { - // modelAnswer.shift(); - return modelAnswer.filter(step => step.type === 'click'); + modelAnswer = modelAnswer.flat(); + return modelAnswer.filter(step => step.gradable === true); } /** From 51d1ec1448378f359cf6b43f77189c1d886b1302 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Johanna=20S=C3=A4nger?= Date: Thu, 29 Sep 2022 15:57:46 +0300 Subject: [PATCH 3/3] Prim in player testbench Add Prim to the player testbench --- .../PrimAVPE-scaffolded+player.html | 153 +++ .../PrimAVPE-scaffolded+player.json | 58 + .../AV/Development/PrimAVPE-scaffolded.css | 96 ++ .../AV/Development/PrimAVPE-scaffolded.js | 1024 +++++++++++++++++ 4 files changed, 1331 insertions(+) create mode 100644 testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded+player.html create mode 100644 testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded+player.json create mode 100644 testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded.css create mode 100644 testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded.js diff --git a/testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded+player.html b/testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded+player.html new file mode 100644 index 0000000..59c4d99 --- /dev/null +++ b/testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded+player.html @@ -0,0 +1,153 @@ + + + + Prim's Algorithm Proficiency Exercise + + + + + + + + + + +
+ + + + + + +
+ + +

+ 		+ + Settings +
+
+
+

+

+

+ +

+
+
+
+ + + + + + + + + + + + + +

JSAV Exercise Player

+ +
+ × + + +
+
+ + +
+
+ + + + +
+
+ +
+
+
+ + +
+
+ + + + +
+
+
+ + + + +
+
+
+
+ + +
+
+ + + + +
+
+
+
+ + +
+
+
+ + +
+
+ + + + +
+
+
+
+
+ + +
+
+
+ × +
+
+

JSON Algorithm Animation Language (JAAL) viewer

+ + + +
+
+
+
+ +
+ + + diff --git a/testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded+player.json b/testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded+player.json new file mode 100644 index 0000000..a226498 --- /dev/null +++ b/testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded+player.json @@ -0,0 +1,58 @@ +{ + "translations" :{ + "en": { + ".avTitle": "Prim's Algorithm Proficiency Exercise", + "av_Authors": "Mohammed Fawzi, Kasper Hellström, Artturi Tilanterä", + ".instructLabel": "Instructions:", + ".instructions": "Reproduce the behavior of Prim's Algorithm for the given graph below. Click on the appropriate edges to add them to the MST. Start with Node A. In case of similar weights add nodes alphabetically.", + "av_ms_mst": "Complete minimum spanning tree", + "av_ms_select_a": "Start by selecting node A", + "av_ms_select_node": "Select {node}, since it's closest to the MCST.", + "av_ms_add_edge": "Add edge ({from}, {to}) to the MCST.", + "av_ms_unreachable": "The nearest unvisited node is at infinite distance. The algorithm ends.", + "av_ms_update_distances": "Update distance to {node}'s neighbors. For updated nodes, set closest node to {node}", + "av_ms_visit_neighbor_add": "Update {node}'s neighbors' distances. Node {neighbor}:
The current distance to {neighbor} is infinite. Add {neighbor} to the priority queue and the distance table. Set {neighbor}'s parent to {node}.", + "av_ms_visit_neighbor_update": "Update {node}'s neighbors' distances. Node {neighbor}:
The distance to {neighbor} from {node} is shorter than the one previously discovered. Update the distance in the priority queue and the table. Set {neighbor}'s parent to {node}.", + "av_ms_visit_neighbor_no_action": "Update {node}'s neighbors' distances. Node {neighbor}:
The distance to {neighbor} from {node} is longer or equal than the one previously discovered. Do not update the distance.", + "#help": "Help", + "#about": "About", + "#enqueue": "Enqueue", + "#update": "Update", + "#dequeue": "Dequeue", + "priority_queue": "Priority Queue", + "node": "Node", + "distance": "Distance", + "parent": "Parent", + "edge": "Edge" + }, + "fi": { + ".avTitle": "Primin algoritmi", + "av_Authors": "Mohammed Fawzi, Kasper Hellström", + ".instructLabel": "Ohjeet:", + ".instructions": "Lisää särmät pienimpään virityspuuhun Primin algoritmin antamassa järjestyksessä. Aloita läpikäynti solmusta A. Klikkaa särmiä lisätäksesi ne virityspuuhun. Jos kahdella särmällä on sama paino, kaari, jonka solmut ovat aakkosjärjestyksessä ensimmäisenä.", + "av_ms_mst": "Verkon pienin virityspuu", + "av_ms_select_a": "Aloitetaan valitsemalla solmu A.", + "av_ms_select_node": "Valitaan solmu {node}, koska se sijaitsee lähinnä virityspuuta.", + "av_ms_add_edge": "Lisätään särmä ({from}, {to}) virityspuuhun.", + "av_ms_unreachable": "Etäisyys lähimpään solmuun, jossa ei ole vierailtu, on ääretön. Algoritmi päättyy.", + "av_ms_update_distances": "Päivitetään etäisyyksiä {node}-solmun naapureihin. Päivitetyille solmuille asetetaan lähin solmu {node}:ksi.", + "av_ms_visit_neighbor_add": "Update {node}'s neighbors' distances. Node {neighbor}:
The current distance to {neighbor} is infinite. Add {neighbor} to the priority queue and the distance table. Set {neighbor}'s parent to {node}.", + "av_ms_visit_neighbor_update": "Update {node}'s neighbors' distances. Node {neighbor}:
The distance to {neighbor} from {node} is shorter than the one previously discovered. Update the distance in the priority queue and the table. Set {neighbor}'s parent to {node}.", + "av_ms_visit_neighbor_no_action": "Update {node}'s neighbors' distances. Node {neighbor}:
The distance to {neighbor} from {node} is longer or equal than the one previously discovered. Do not update the distance.", + "#help": "Ohje", + "#about": "Lisätietoa", + "#enqueue": "Lisää", + "#update": "Päivitä", + "#dequeue": "Poista", + "priority_queue": "Prioriteettijono", + "node": "Solmu", + "distance": "Etäisyys", + "parent": "Vanhempi", + "edge": "Särmä" + } + }, + "params": { + "JXOP-feedback": "continuous", + "JXOP-fixmode": "fix" + } +} diff --git a/testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded.css b/testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded.css new file mode 100644 index 0000000..e2f3ae8 --- /dev/null +++ b/testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded.css @@ -0,0 +1,96 @@ +#container { + width: 900px; + height: 920px; +} + +.jsavline { + height: 45px; + margin: 0 0 0 20px; +} + +#procontrols { + text-align: center; +} + +.jsavgraph { + margin-top: 0; + margin-bottom: 0; +} + +.jsavgraph svg { + z-index: 0; +} + +.jsavnode.marked { + background-color: #FFF050; +} +.jsavgraph .jsavedge { + stroke-width: 10; + stroke: #d1c39d; +} +.jsavgraph .jsavedge.marked { + stroke-width: 16; + stroke: #ffe000;; +} +.jsavgraph .jsavedge.queued { + stroke-width: 10; + stroke: #d59f0d; +} +.jsavgraph .jsavedge.highlighted { + stroke: #89e681; + stroke-width: 10; +} +.jsavgraph .jsavnode.highlighted { + background-color: #89e681; +} + +.jsavindex.highlighted { + background-color: #89e681; +} + +.jsavtree .jsavnode.highlighted { + background-color: #89e681; +} +.jsavgraph .jsavedgelabel { + font-size: 16px; + background-color: transparent; + text-shadow: 0 0 5px #fff; +} +.jsavautoresize .jsavnode { + min-width: 45px; + min-height: 45px; +} + +.jsavtree { + min-width: 400px; + min-height: 250px; + margin: 0px; +} + +.bintree { + min-width: 400px; + min-height: 250px; + max-width: 400px; + max-height: 250px; + margin: auto; + background-color: #ffffff; + border: 1px #000000 solid; +} + +.prioqueue { + text-align: center; + margin: 0px; +} + +.jsavtree svg { + margin: 10px; +} + +.jsavtreenode { + margin: 10px; +} + +.avcontainer .jsavhorizontalarray > li:first-child { + max-width: none !important; + min-width: 70px !important; +} \ No newline at end of file diff --git a/testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded.js b/testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded.js new file mode 100644 index 0000000..2a644a2 --- /dev/null +++ b/testbench/OpenDSA/AV/Development/PrimAVPE-scaffolded.js @@ -0,0 +1,1024 @@ +/* global ODSA, graphUtils */ +(function ($) { + "use strict"; + var exercise, + graph, + minheap, + table, + config = ODSA.UTILS.loadConfig(), + interpret = config.interpreter, + settings = config.getSettings(), + jsav = new JSAV($('.avcontainer'), {settings: settings}); + + var heapsize = jsav.variable(0); + var debug = false; // produces debug prints to console + + jsav.recorded(); + + function init() { + // Settings for input + const width = 500, height = 400, // pixels + weighted = true, + directed = false, + nVertices = [11, 3], + nEdges = [14, 2]; + + // First create a random planar graph instance in neighbour list format + let nlGraph = undefined, + bestNlGraph = undefined, + bestResult = {score: 0}, + trials = 0; + const targetScore = 5, maxTrials = 100; + let sumStats = { + relaxations: 0, + singleClosest: 0, + multipleClosest: 0, + longerPath: 0, + unreachable: 0 }; + + let result = {score: 0}; + while (result.score < targetScore && trials < maxTrials) { + nlGraph = graphUtils.generatePlanarNl(nVertices, nEdges, weighted, + directed, width, height); + result = testPrim(nlGraph); + if (result.score > bestResult.score) { + bestNlGraph = nlGraph; + bestResult = result; + } + for (let k of Object.keys(result.stats)) { + if (result.stats[k] > 0) { + sumStats[k]++; + } + } + trials++; + } + nlGraph = bestNlGraph; + + let statsText = "Trials: " + trials + "\n"; + for (let k of Object.keys(sumStats)) { + statsText += k + ": " + sumStats[k] + "\n"; + } + console.log(statsText); + + // Create a JSAV graph instance + if (graph) { + graph.clear(); + } + graph = jsav.ds.graph({// Condition: + width: width, + height: height, + layout: "manual", + directed: directed + }); + + //Shift the x and y of each node 30 left and up. + //Otherwise the graph is centered bottom right, now it is centered + //more or less in the middle + nlGraph.vertices.forEach(vertex => { + vertex.x = vertex.x - 30; + vertex.y = vertex.y - 30; + }) + graphUtils.nlToJsav(nlGraph, graph); + addEdgeClickListeners(); + addMinheap(); + addTable(); + graph.layout(); + graph.nodes()[0].addClass("marked"); // mark the 'A' node + jsav.displayInit(); + return [graph, minheap]; + } + + function fixState(modelGraph) { + var graphEdges = graph.edges(), + modelEdges = modelGraph.edges(); + + // compare the edges between exercise and model + for (var i = 0; i < graphEdges.length; i++) { + var edge = graphEdges[i], + modelEdge = modelEdges[i]; + if (modelEdge.hasClass("marked") && !edge.hasClass("marked")) { + // mark the edge that is marked in the model, but not in the exercise + markEdge(edge); + break; + } + } + } + + function model(modeljsav) { + var i, + graphNodes = graph.nodes(); + // create the model + var modelGraph = modeljsav.ds.graph({ + width: 500, + height: 400, + layout: "automatic", + directed: false + }); + + // copy the graph and its weights + graphUtils.copy(graph, modelGraph, {weights: true}); + var modelNodes = modelGraph.nodes(); + + var distanceMatrixValues = []; + for (i = 0; i < graphNodes.length; i++) { + distanceMatrixValues.push([graphNodes[i].value(), "∞", "-"]); + } + distanceMatrixValues[0][1] = 0; + + var distances = modeljsav.ds.matrix(distanceMatrixValues, { + style: "table", + center: false + }); + distances.element.css({ + position: "absolute", + top: 0, + left: 10 + }); + + // Mark the 'A' node + modelNodes[0].addClass("marked"); + + const mintree = modeljsav.ds.binarytree(); + mintree.layout(); + + modeljsav.displayInit(); + + // start the algorithm + prim(modelNodes, distances, modeljsav, mintree); + + modeljsav.umsg(interpret("av_ms_mst")); + // hide all edges that are not part of the spanning tree + var modelEdges = modelGraph.edges(); + for (i = 0; i < modelGraph.edges().length; i++) { + if (!modelEdges[i].hasClass("marked")) { + modelEdges[i].hide(); + } + } + + modeljsav.step(); + + return [modelGraph, mintree]; + } + + function markEdge(edge, av) { + edge.addClass("marked"); + edge.start().addClass("marked"); + edge.end().addClass("marked"); + if (av) { + av.gradeableStep(); + } else { + exercise.gradeableStep(); + } + } + + /** + * + * @param {*} nodes is an array of JSAV nodes + * @param {*} distances is the JSAV matrix of the distances + * @param {*} av is the model answer AV + * @param mintree is the priority queue. + */ + function prim(nodes, distances, av, mintree) { + var modelheapsize = 0; + const aNode = nodes.find(node => node.value() === "A"); + + aNode.neighbors().forEach(node => visitNeighbour(aNode, node)); + // console.log(aNode); + + while (modelheapsize > 0) { + const rootVal = deleteRoot(); + const label = rootVal.charAt(rootVal.length - 5); + const dstNode = nodes.find(node => node.value() === label); + const dstIndex = dstNode.value().charCodeAt(0) - "A".charCodeAt(0); + const srcNode = nodes.find(node => node.value() === distances.value(dstIndex, 2)) + const edge = dstNode.edgeFrom(srcNode) ?? dstNode.edgeTo(srcNode); + av.umsg(interpret("av_ms_add_edge"), + {fill: {from: srcNode.value(), to: dstNode.value()}}); + edge.removeClass("queued"); + if (!edge.hasClass("marked")) { + markEdge(edge, av); + } + const neighbours = dstNode.neighbors().filter(node => + !node.hasClass("marked")); + neighbours.sort((a, b) => a.value() > b.value()); + neighbours.forEach(node => visitNeighbour(dstNode, node)) + } + av.umsg(interpret("av_ms_unreachable")); + av.step(); + + + /** + * Helper function to visit a node in the model solution. + * @param src source node + * @param neighbour neighbour node that is visited + */ + function visitNeighbour (src, neighbour) { + const edge = src.edgeTo(neighbour) ?? src.edgeFrom(neighbour); + const neighbourIndex = neighbour.value().charCodeAt(0) - "A".charCodeAt(0); + const currNeighbourDist = getDistance(neighbourIndex); + const dist = edge._weight; + + if (currNeighbourDist === Infinity) { + addNode(src.value(), neighbour.value(), dist); + updateModelTable(neighbour, src, dist); + debugPrint("Model solution gradeable step: ADD ROUTE WITH DIST:", + dist + neighbour.value()); + av.umsg(interpret("av_ms_visit_neighbor_add"), + {fill: {node: src.value(), neighbor: neighbour.value()}}); + highlight(edge, neighbour); + av.gradeableStep(); + } else if (dist < currNeighbourDist) { + updateNode(src.value(), neighbour.value(), dist); + updateModelTable(neighbour, src, dist); + debugPrint("Model solution gradeable step: UPDATE DISTANCE TO:", + dist + neighbour.value()); + + av.umsg(interpret("av_ms_visit_neighbor_update"), + {fill: {node: src.value(), neighbor: neighbour.value()}}); + highlight(edge, neighbour); + av.gradeableStep(); + } else { + debugPrint("KEEP DISTANCE THE SAME:", + currNeighbourDist + neighbour.value()) + + av.umsg(interpret("av_ms_visit_neighbor_no_action"), + {fill: {node: src.value(), neighbor: neighbour.value()}}); + highlight(edge, neighbour); + av.step(); + } + removeHighlight(edge, neighbour); + } + + /** + * Helper function that deletes the root node and does a step + * to display the text which node is deleted. + * @returns the value of the deleted node. + */ + function deleteRoot () { + if (!mintree.root() || modelheapsize <= 0) { + return; + } + modelheapsize -= 1; + + const ret = mintree.root().value(); + + //Mark table row as "unused" (grey background) + //Then set selected message, and step the av. + const nodeLabel = ret.charAt(ret.length - 5) + distances.addClass(nodeLabel.charCodeAt(0) - "A".charCodeAt(0), true, "unused") + av.umsg(interpret("av_ms_select_node"), + {fill: {node: nodeLabel}}); + av.step(); + + // Parent node of last node in the heap + const parentLast = findParent(modelheapsize, mintree); + + // Last node in the heap + const lastNode = ((modelheapsize)%2 === 1) ? parentLast.left() + : parentLast.right(); + + if (lastNode) { + mintree.root().value(lastNode.value()); + lastNode.value(ret); + lastNode.remove(); + minHeapify(mintree.root()); + } else { + mintree.root().remove(); + } + mintree.layout(); + return ret + } + + /** + * Helper function to add a new node. + * @param srcLabel label of the source node + * @param dstLabel destination node's label + * @param distance distance to the node + */ + function addNode (srcLabel, dstLabel, distance) { + var i = modelheapsize; + modelheapsize += 1; + const label = distance + "
" + dstLabel + " (" + srcLabel + ")" + const newNode = mintree.newNode(label); + if (i === 0) { + mintree.root(newNode); + } else { + const parent = findParent(i, mintree); + (i % 2 === 1) ? parent.left(newNode) : parent.right(newNode); + } + + var node = newNode; + while (i > 0 && node.parent() + && extractDistance(node.parent()) >= distance) { + //If the distance is the same as the parent, we only want to swap them if + //the destination node alphabetically comes first compared to the parent. + //If parent is alphabetically first, + //we break from the while loop. + if (extractDistance(node.parent()) === distance + && extractDestination (node.parent()) < extractDestination (node)) { + break; + } + node.value(node.parent().value()); + i = Math.floor((i-1)/2); + node.parent().value(label); + node = node.parent(); + } + + //Add queued class to the edge + const srcNode = nodes.filter(node => + node.element[0].getAttribute("data-value") === srcLabel)[0]; + const dstNode = nodes.filter(node => + node.element[0].getAttribute("data-value") === dstLabel)[0]; + const edge = dstNode.edgeFrom(srcNode) ?? dstNode.edgeTo(srcNode); + edge.addClass("queued") + + mintree.layout(); + } + + /** + * Helper function to update a node to its new value. + * @param srcLabel label of the source node + * @param dstLabel destination node's label + * @param distance distance to the node + */ + function updateNode(srcLabel, dstLabel, distance) { + const label = distance + "
" + dstLabel + " (" + srcLabel + ")" + const nodeArr = getTreeNodeList(mintree.root()) + //Grab first node with the correct destination. + const updatedNode = nodeArr.filter(node => + node.value().charAt(node.value().length - 5) === dstLabel)[0]; + + //If no node with the correct label exists, do nothing. + if (!updatedNode) { + return; + } + debugPrint("UPDATE:", updatedNode.value(), "TO:", distance + label); + + //Add queued class to the edge + const srcNode = nodes.filter(node => + node.element[0].getAttribute("data-value") === srcLabel)[0]; + const dstNode = nodes.filter(node => + node.element[0].getAttribute("data-value") === dstLabel)[0]; + const edge = dstNode.edgeFrom(srcNode) ?? dstNode.edgeTo(srcNode) + edge.addClass("queued") + //Remove queued class from the old edge + const oldLabel = updatedNode.value(); + const oldSrcLabel = oldLabel.charAt(oldLabel.length - 2); + const oldSrcNode = nodes.filter(node => + node.element[0].getAttribute("data-value") === oldSrcLabel)[0]; + const oldEdge = dstNode.edgeFrom(oldSrcNode) ?? dstNode.edgeTo(oldSrcNode) + oldEdge.removeClass("queued"); + updatedNode.value(label); + //Inline while loop to move the value up if needed. + //Because if you pass a node along as a parameter, it does not like + //being asked about its parent... Grading will break in ODSA part. + var node = updatedNode; + while (node != mintree.root() && + extractDistance(node) < extractDistance(node.parent())) { + const temp = node.parent().value(); + node.parent().value(node.value()); + node.value(temp); + node = node.parent(); + } + mintree.layout(); + } + + function highlight(edge, node) { + //Mark current edge as highlighted + edge.addClass("highlighted"); + //Mark current node being visited as highlighted + node.addClass("highlighted"); + //Mark current node being visited in the table + distances.addClass(node.value().charCodeAt(0) - "A".charCodeAt(0), + true, "highlighted"); + //Mark current node being visited in the mintree + const treeNodeList = getTreeNodeList(mintree.root()); + const treeNode = treeNodeList.filter(treeNode => + treeNode.value().charAt(treeNode.value().length - 5) + === node.value())[0]; + if (treeNode) { + treeNode.addClass("highlighted") + } + } + + function removeHighlight(edge, node) { + edge.removeClass("highlighted"); + node.removeClass("highlighted"); + distances.removeClass(node.value().charCodeAt(0) - "A".charCodeAt(0), + true, "highlighted") + const treeNodeList = getTreeNodeList(mintree.root()); + const treeNode = treeNodeList.filter(treeNode => + treeNode.value().charAt(treeNode.value().length - 5) + === node.value())[0]; + if (treeNode) { + treeNode.removeClass("highlighted") + } + } + + /** + * Helper function to update the table. Sets dst's distance to distance + * via parent src. + * @param dst destination node + * @param src source node + * @param distance distance to be inserted in the table. + */ + function updateModelTable (dst, src, distance) { + const dstIndex = dst.value().charCodeAt(0) - "A".charCodeAt(0); + debugPrint("ADD:", dst.value(), distance, src.value()) + distances.value(dstIndex, 1, distance) + distances.value(dstIndex, 2, src.value()) + } + + // returns the distance given a node index + function getDistance(index) { + var dist = parseInt(distances.value(index, 1), 10); + if (isNaN(dist)) { + // dist = 99999; + dist = Infinity; + } + return dist; + } + // returns the node index given the node's value + function getIndex(value) { + return value.charCodeAt(0) - "A".charCodeAt(0); + } + } + + function testPrim(graph) { + const nVertices = graph.vertices.length; + let stats = { + relaxations: 0, + singleClosest: 0, + multipleClosest: 0, + longerPath: 0, + unreachable: 0 + }; + + // Initial vertex is at index 0. Array 'distances' stores length of + // shortest path from the initial vertex to each other vertex. + // Array 'visited' stores the visitedness of each vertex. A visited vertex + // has their minimum distance decided permanently. + var distance = Array(nVertices); + var visited = Array(nVertices); + for (let i = 0; i < nVertices; i++) { + distance[i] = Infinity; + visited[i] = false; + } + distance[0] = 0; + + for (let i = 0; i < nVertices; i++) { + var v = primMinVertex(distance, visited, stats); + visited[v] = true; + if (distance[v] === Infinity) { + stats.unreachable++; + break; + } + for (let e of graph.edges[v]) { + let d = distance[e.v]; + let dNew = e.weight; + if (e.weight < d) { + // Update distance + if (d < Infinity) { + stats.relaxations++; + } + distance[e.v] = e.weight; + } else if (visited[e.v] === false) { + stats.longerPath++; + } + } + } + + // Analyse statistics + let score = 0; + + // Properties of a good Prim input: + // + // 1. At some point of algorithm, there is a unique choice for the closest + // unvisited vertex. + score += (stats.singleClosest > 0) ? 1 : 0; + + // 2. At some point of algorithm, there are multiple equal choices for + // closest unvisited vertex. + score += (stats.multipleClosest > 0) ? 1 : 0; + + // 3. There is at least one vertex which is unreachable from the initial + // vertex v0. + score += (stats.unreachable > 0) ? 1 : 0; + + // 4. There is a vertex that has multiple paths from v0 and its distance + // is updated to a shorter value during the algorithm. + score += (stats.relaxations > 0) ? 1 : 0; + + // 4. There is a vertex that has multiple paths from v0 and its distance + // is not updated to a shorter value during the algorithm. + score += (stats.longerPath > 0) ? 1 : 0; + + return { score: score, stats: stats } + } + + /* + * Helper for testPrim(): select nearest unvisited vertex. + * If there are multiple nearest vertices, select the one with lowest index. + * + * Parameters: + * distance: array of integers, each having a positive value + * visited: array of booleans indicating which vertices are visited + * stats: a statistics object created by testPrim(). This is updated. + * + * Returns: + * (int): index of the nearest unvisited vertex. + */ + function primMinVertex(distance, visited, stats) { + // Find the unvisited vertex with the smalled distance + let v = 0; // Initialize v to first unvisited vertex; + for (let i = 0; i < visited.length; i++) { + if (visited[i] === false) { + v = i; + break; + } + } + // Now find the smallest value + let equalValues = 1; + for (let i = 0; i < visited.length; i++) { + if (visited[i] === false) { + if (distance[i] < distance[v]) { + v = i; + equalValues = 1; + } else if (distance[i] === distance[v] && i !== v && + distance[v] < Infinity) { + // There are multiple unvisited vertices with the same finite + // distance. + equalValues++; + } + } + } + if (equalValues === 1) { + stats.singleClosest++; + } else { + stats.multipleClosest++; + } + return v; + } + + // Process About button: Pop up a message with an Alert + function about() { + window.alert(ODSA.AV.aboutstring(interpret(".avTitle"), interpret("av_Authors"))); + } + + exercise = jsav.exercise(model, init, { + compare: [{ class: "marked" }], + controls: $('.jsavexercisecontrols'), + fix: fixState + }); + exercise.reset(); + + /** + * Edge click listeners are bound to the graph itself, + * so each time the graph is destroyed with reset, it needs + * to be added again. Therefore they are in a wrapper function. + */ + function addEdgeClickListeners() { + $(".jsavgraph").on("click", ".jsavedge", edgeClicked); + } + + $(".jsavcontainer").on("click", ".jsavnode", function () { + window.alert("Please, click on the edges, not the nodes."); + }); + + $("#about").click(about); + + /** + * The edge click listener creates a JSAV pop-up whenever an edge is + * clicked. The pop-up has two buttons: enqueue and update. + * Enqueue adds a node to the priority queue + * Update updates the value of a node in the priority queue. + * The edge click listener determines which edge is clicked, + * what the nodes on either end are, which one is to be updated + * into the queue and what the distance from A is. After that, + * the two buttons are created in the pop-up, and the corresponding + * event handlers attached. + */ + function edgeClicked () { + const edge = $(this).data("edge"); + const node1id = $(this)[0].getAttribute("data-startnode"); + const node2id = $(this)[0].getAttribute("data-endnode"); + const node1 = $("#" + node1id).data("node"); + const node2 = $("#" + node2id).data("node"); + + const src = isMarked(node1) ? node1 : node2; + const dst = (src === node1) ? node2 : node1; + if (!src || !dst) { + console.warn("Either start or end is not defined. Start: ", + src, "\tEnd:", dst); + return + } + const srcLabel = src.element[0].getAttribute("data-value"); + const dstLabel = dst.element[0].getAttribute("data-value"); + const dist = edge._weight; + const label = dist + dstLabel; + + //Edge is listed in alphabetical order, regardless of which + //node is listed as the src or dst in JSAV. + const options = { + "title": interpret("edge") + " " + ((srcLabel < dstLabel) + ? (srcLabel + dstLabel) + : (dstLabel + srcLabel)), + "width": "200px", + } + + const html = "
"; + + const popup = JSAV.utils.dialog(html, options); + + // Enqueue and update button event handlers + $("#enqueueButton").click({srcLabel, dstLabel, dist, popup, edge}, + enqueueClicked); + $("#updateButton").click({srcLabel, dstLabel, dist, popup, edge}, + updateClicked); + } + + /** + * @param node node to be queried if it is marked + * @returns true when node contains class 'marked', else false + */ + function isMarked (node) { + return node.element[0].classList.contains("marked") + } + + function findColByNode (nodeLabel) { + for (var i = 1; i < 15; i++) { + if (nodeLabel === table.value(0, i)) { + return i; + } + } + } + + /** + * Add a node to the priority queue with label dstLabel and distance newDist. + * Update the table to indicate the distance newDist and parent srcLabel. + * @param event click event, which has the parameters srcLabel, dstLabel, + * newDist and popup. + * @param srcLabel the source node label + * @param dstLabel the destination node label + * @param newDist the new distance from A to destination + * @param popup the popup window, used to close the window before returning. + */ + + function enqueueClicked (event) { + const srcLabel = event.data.srcLabel; + const dstLabel = event.data.dstLabel; + const dist = event.data.dist; + const popup = event.data.popup; + debugPrint(event.data.edge) + event.data.edge.addClass("queued") + + updateTable(srcLabel, dstLabel, dist); + insertMinheap(srcLabel, dstLabel, dist); + debugPrint("Exercise gradeable step: enqueue edge " + srcLabel + "-" + + dstLabel + " distance " + dist); + exercise.gradeableStep(); + popup.close(); + } + + /** + * Update the first instance of the node with label dstLabel. The updated + * node is moved up or down the tree as needed. + * @param event click event, which has the parameters srcLabel, dstLabel, + * newDist and popup. + * @param srcLabel the source node label + * @param dstLabel the destination node label + * @param newDist the new distance from A to destination + * @param popup the popup window, used to close the window before returning. + */ + function updateClicked (event) { + const srcLabel = event.data.srcLabel; + const dstLabel = event.data.dstLabel; + const dist = event.data.dist; + const popup = event.data.popup; + + const nodeArr = getTreeNodeList(minheap.root()) + //Grab first node with the correct destination. + const updatedNode = nodeArr.filter(node => + node.value().charAt(node.value().length - 5) === dstLabel)[0]; + + //If no node with the correct label exists, do nothing. + if (!updatedNode) { + popup.close(); + return; + } + + updateTable(srcLabel, dstLabel, dist); + //Add class to the new edge + event.data.edge.addClass("queued") + //remove class from the old edge + //Have old label, find previous source node label + const oldLabel = updatedNode.value(); + const oldSrcLabel = oldLabel.charAt(oldLabel.length - 2); + //Find node objects to grab the egde + const oldNode = graph.nodes().filter(node => + node.element[0].getAttribute("data-value") === oldSrcLabel)[0]; + const dstNode = graph.nodes().filter(node => + node.element[0].getAttribute("data-value") === dstLabel)[0]; + const oldEdge = graph.getEdge(oldNode, dstNode) + ?? graph.getEdge(dstNode, oldNode); + //Remove the queued class. + oldEdge.removeClass("queued") + + + const oldDist = oldLabel.match(/\d+/)[0]; + const label = dist + "
" + dstLabel + " (" + srcLabel + ")"; + updatedNode.value(label); + + if (dist > oldDist) { + minHeapify(updatedNode) + } else { + var node = updatedNode; + while (node != minheap.root() && + extractDistance(node) <= extractDistance(node.parent())) { + //If the distance is the same as the parent node, we only want to + //swap them around if the node's destination comes earlier in the + //alphabet than its parent's. + if (extractDistance(node) === extractDistance(node.parent()) && + extractDestination(node) > extractDestination(node.parent())) { + //Alphabetically later, so break the while loop. + break; + } + const temp = node.parent().value(); + node.parent().value(node.value()); + node.value(temp); + node = node.parent(); + } + } + debugPrint("Exercise gradeable step: update edge " + srcLabel + "-" + + dstLabel + " distance " + dist); + exercise.gradeableStep(); + popup.close(); + } + + /** + * Preorder traversal to get node list of the tree + * Since there is no function for this in the JSAV library + * @param node the root node to start the traversal at + * @param arr array to store the nodes in. Optional parameterl + * an empty array is initialised if none is supplied. + * @returns an array containing the nodes of the tree. + */ + function getTreeNodeList (node, arr) { + var nodeArr = arr || []; + + if (node) { + nodeArr.push(node); + nodeArr = getTreeNodeList(node.left(), nodeArr); + nodeArr = getTreeNodeList(node.right(), nodeArr); + } + return nodeArr; + } + + /** + * Update the table: dstLabel's distance is set to newDist, + * with parent set to srcLabel + * @param srcLabel + * @param dstLabel + * @param newDist + */ + function updateTable (srcLabel, dstLabel, newDist) { + const dstIndex = findColByNode(dstLabel); + table.value(1, dstIndex, newDist) + table.value(2, dstIndex, srcLabel) + } + + /** + * Add the minheap to the JSAV instance. + * The function adds a dummy div with class 'bintree' to center the minheap. + * + */ + function addMinheap () { + if (minheap) { + minheap.clear(); + $(".prioqueue").remove(); + $(".bintree").remove(); + } + heapsize = heapsize.value(0); + $(".jsavcanvas").append("
" + + interpret("priority_queue") + + "
"); + minheap = jsav.ds.binarytree({relativeTo: $(".bintree"), + myAnchor: "center center"}); + minheap.layout() + const html = ""; + $(".jsavtree").append(html) + $("#removeButton").css({"float": "right", + "position": "relative", + "margin": "1em"}); + + //Add remove button + $("#removeButton").click(function() { + const deleted = minheapDelete(0); + if (!deleted) { + return; + } + //Format of node label: "x
D (S)", where x is the distance, + //D is the destination node label and S is the source node label + const nodeLabel = deleted.charAt(deleted.length - 5); + const node = graph.nodes().filter(node => + node.element[0].getAttribute("data-value") === nodeLabel)[0]; + const srcLabel = table.value(2, findColByNode(nodeLabel)); + // const srcLabel = deleted.charAt(deleted.length - 2); + const srcNode = graph.nodes().filter(node => + node.element[0].getAttribute("data-value") === srcLabel)[0]; + const edge = graph.getEdge(node, srcNode) ?? graph.getEdge(srcNode, node); + edge.removeClass("queued") + if (!edge.hasClass("marked")) { + markEdge(edge); + } + minheap.layout(); + }) + } + + /** + * Add the initial distance table to the JSAV. + * The table has distance for A as 0, '∞' for the rest + * Parent is '-' for all. + */ + function addTable () { + if (table) { + table.clear() + } + const labels = ["A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", "N"] + const labelArr = [interpret("node"), ...labels]; + const distanceArr = Array.from('∞'.repeat(labels.length - 1)); + distanceArr.unshift(interpret("distance"), 0); + const parentArr = Array.from('-'.repeat(labels.length)); + parentArr.unshift(interpret("parent")); + const width = String((labels.length) * 30 + 100) + "px"; + table = jsav.ds.matrix([labelArr, distanceArr, parentArr], + {style: "table", + width: width, + relativeTo: $(".jsavbinarytree"), + myAnchor: "center top", + top: "150px"}); + } + + /** + * Insert the new node into the minheap according to the + * insertMinheap algorithm. + * @param srcLabel label of the source node + * @param dstLabel label of the destination node + * @param distance distance to be inserted. + */ + function insertMinheap (srcLabel, dstLabel, distance) { + var i = heapsize.value(); + + heapsize.value(heapsize.value() + 1); + + const label = distance + "
" + dstLabel + " (" + srcLabel + ")" + const newNode = minheap.newNode(label); + if (i === 0) { + minheap.root(newNode); + } else { + const parent = findParent(i, minheap); + (i % 2 === 1) ? parent.left(newNode) : parent.right(newNode); + } + + // Heapify up + var node = newNode; + while (i > 0 && extractDistance(node.parent()) >= distance) { + //If the distance is the same as the parent, we only want to swap them if + //the destination node alphabetically comes first compared to the parent. + //If parent is alphabetically first, + //we break from the while loop. + if (extractDistance(node.parent()) === distance && extractDestination (node.parent()) < extractDestination (node)) { + break; + } + node.value(node.parent().value()); + i = Math.floor((i-1)/2); + node.parent().value(label); + node = node.parent(); + } + + minheap.layout(); + } + + /** + * minHeapify algorithm from a node. + * @param {*} root The node from which to min-heapify. + */ + function minHeapify(root) { + const left = root.left(); + const right = root.right(); + var smallest = root; + if (left) extractDestination(left) + if (left && extractDistance(left) < extractDistance(smallest)) { + smallest = left; + } + if (left && extractDistance(left) === extractDistance(smallest) && + extractDestination(left) < extractDestination(smallest)) { + smallest = left; + } + // if (left && extra) + if (right && extractDistance(right) < extractDistance(smallest)) { + smallest = right; + } + if (right && extractDistance(right) === extractDistance(smallest) && + extractDestination(right) < extractDestination(smallest)) { + smallest = right; + } + if (smallest != root) { + const temp = smallest.value(); + smallest.value(root.value()); + root.value(temp); + minHeapify(smallest); + } + + } + + /** + * minheapDelete function, delete node at index. + * @returns value of the deleted node. + */ + function minheapDelete() { + if (heapsize.value() === 0) { + return + } + + heapsize.value(heapsize.value() - 1); + + //PLACEHOLDER: be able to remove other than min + const ret = minheap.root().value(); + + // Parent of the last node in the heap + const parentLast = findParent(heapsize.value(), minheap); + + // The last node in the heap (the one to be deleted) + const lastNode = (heapsize.value() % 2 === 1) ? parentLast.left() + : parentLast.right(); + + if (lastNode) { + // Swap the values of the root and the last node + minheap.root().value(lastNode.value()); + lastNode.value(ret); + + lastNode.remove(); + + minHeapify(minheap.root()); + } else { + minheap.root().remove(); + } + return ret + } + + /** + * Return the parent node of node at index. + * @param {*} index the index of the node whose parent we want. + * @returns parent of node at index. + */ + function findParent (index, heap) { + const chain = []; + while (index > 0) { + index = Math.floor((index - 1) / 2); + chain.unshift(index); + } + var parent_node = heap.root(); + for (var i = 1; i < chain.length; i++) { + var prev_index = chain[i-1]; + var curr_index = chain[i]; + if (prev_index * 2 + 1 === curr_index) { + parent_node = parent_node.left(); + } else { + parent_node = parent_node.right(); + } + } + + return parent_node; + } + + /** + * Helper function to extract the distance from the minheap tree. + * @param {*} node node whose distance is being extracted + * @returns the distance. + */ + function extractDistance (node) { + return Number(node.value().match(/\d+/)[0]) + } + + /** + * Helper function to extract the destination node from the minheap tree. + * @param {*} node node whose destination is being extracted + * @returns the distance. + */ + function extractDestination (node) { + return node.value().match(/[A-Z]/)[0]; + } + + + function debugPrint(x) { + if (debug) { + debugPrint(x); + } + } + +}(jQuery));