30:T5e9,function updateScores() { /* We update the calculation of scores for each node For each of the "leave" base nodes (nodes with no children -> candidates that have never been selected above another candidate) we assign a score of 0. We traverse the graph asigning each ancestor a score that is at least 1 more than their children We avoid circular references, by ignoring ancestors that have already been in the same branch children. */ // 0 Points to base of the graph _.each(nodesDict, (d,key) => d.score = 0) // Recursive function // node: is the node to analyse, // score: is target score (+1) higher than a previous child, // ignore: is a set of nodes to be ignored to prevent circular references function updateScores(node, score, ignore) { // We update the score if the target is higher than curren score if (node && score > node.score) node.score = score; node && node.ancestors && node.ancestors.forEach(ancestor => { if (!ignore.has(ancestor)) { const newIgnoreSet = new Set(ignore) // We update scores for each of the ancestors (expect ignored ones) updateScores(ancestor, score +1, newIgnoreSet.add(node)); } }) } // We get each of the leaves (nodes with no children) const leaves = _.chain(nodesDict).map(d => d).filter(d => !d.children.size).value(); // For each leave node, we update the scores _.each(leaves,d => { const ignore = new Set(); updateScores(d, 0, ignore) }) }31:[] 2e:{"title":"Perfil electoral","cells":[{"id":0,"value":"md`# Perfil electoral`","pinned":false,"hidden":false,"mode":"ojs"},{"id":1558,"value":"md`Este es un ejercicio para identificar personas que consideras líderes positivos. Te presentamos pares de personas y debes elegir uno en cada par. Progresivamente iras priorizandolos y al final obtendrás una lista de tus TOP líderes positivos. Te invitamos a sacar una foto de pantalla y compartirla en twitter bajo el hashtag #lideres_positivos`","pinned":false,"hidden":false,"mode":"ojs"},{"id":87,"value":"viewof myProvider = {\n const storedProvider = localStorage.getItem(\"myProvider\") || \"twitter.com\"\n return radio({\n title: 'Para guardar los datos, necesitamos identificarte en forma única, por lo que te pedimos que te autentiques con alguno de los siguientes proveedores de servicio en los que ya tengas una cuenta de usuario',\n description: 'Nuetsro sitio nunca accederá a tus credenciales. Sólo serán solicitadas por el respectivo proveedor (ej. en un panel autenticación de Twitter)',\n options: [\n { label: 'Twitter', value: \"twitter.com\" }\n ],\n value: storedProvider\n })\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1307,"value":"{\n let msg = html``\n if (authError) {\n msg = html`

${authError.message}

`\n } else {\n if (!user) {\n msg = html`

No estás autenticado

`\n } else {\n msg = html`

Estás autenticado como ${user.displayName} en ${user.providerData[0].providerId}

`\n }\n }\n \n return msg\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":15,"value":"viewof user = {\n const provider = providers[myProvider];\n const form = html`

`;\n form.value = null\n form.button.onclick = async event => {\n mutable authError = null\n firebase.auth().signInWithPopup(provider).then(function(result) {\n console.log(\"result\", result)\n form.value = result.user\n form.dispatchEvent(new CustomEvent(\"input\"));\n }).catch(function(error) {\n mutable authError = error\n console.error(error)\n })\n };\n return form;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":682,"value":"html`\n

\n`\n","pinned":false,"hidden":false,"mode":"ojs"},{"id":132,"value":"md`## Confguracion y librerías`","pinned":false,"hidden":false,"mode":"ojs"},{"id":699,"value":"html`\n\n`\n","pinned":false,"hidden":false,"mode":"ojs"},{"id":1117,"value":"candidate1 = {\n tries;\n return getNextCandidate();\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1120,"value":"candidate2 = {\n \n const higherScoring = _.orderBy(higherScoreCandidates(candidate1), d => d.score);\n \n if (higherScoring.length) {\n return _.sample(higherScoring);\n } else {\n const restOfCandidates = leaders.filter(d => {\n // Avoid previous answers\n const pairKey = [d.id, candidate1.id].sort().join(\"-\"); \n return !myAnswers[pairKey] && (d != candidate1)\n })\n return _.sample(restOfCandidates);\n }\n}\n \n","pinned":false,"hidden":false,"mode":"ojs"},{"id":359,"value":"myAnswers = {\n const previousAnswers = JSON.parse(localStorage.getItem(\"myAnswers\")) || {};\n rebuildGraph(previousAnswers)\n\n //return {}\n return previousAnswers\n}\n","pinned":false,"hidden":false,"mode":"ojs"},{"id":1379,"value":"localSave = {\n myAnswers;\n tries;\n localStorage.setItem(\"myAnswers\", JSON.stringify(myAnswers))\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1352,"value":"mutable authError = null","pinned":false,"hidden":false,"mode":"ojs"},{"id":1334,"value":"mutable saveResult = null","pinned":false,"hidden":false,"mode":"ojs"},{"id":1417,"value":"graphUpdate = {\n myAnswers;\n rebuildGraph(myAnswers);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1251,"value":"function saveData() {\n return db.collection(\"answers\").doc(user.uid).set(\n {\"answers\": JSON.stringify(myAnswers)}\n , { merge: true });\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1429,"value":"function resetAll() {\n _.each(myAnswers, (d,key)=> {\n delete myAnswers[key];\n })\n \n _.each(nodesDict, (d,key)=> {\n delete nodesDict[key];\n })\n \n leaders.forEach(d => {\n d.score = 0;\n d.ancestors = new Set();\n d.children = new Set();\n })\n\n mutable nodes = [];\n mutable links = [];\n \n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1393,"value":"function rebuildGraph(answers) {\n _.each(answers, (d,key) => {\n const candidate1 = leadersDict[d.first];\n const candidate2 = leadersDict[d.second];\n \n candidate1.score = candidate1.score || 0\n candidate2.score = candidate2.score || 0\n\n candidate1.ancestors = candidate1.ancestors || new Set();\n candidate2.ancestors = candidate2.ancestors || new Set();\n candidate1.children = candidate1.children || new Set();\n candidate2.children = candidate2.children || new Set();\n\n\n candidate2.ancestors.add(candidate1);\n candidate1.children.add(candidate2);\n\n candidate1.count = candidate1.count \n ? candidate1.count +1 : 1;\n candidate2.count = candidate2.count \n ? candidate2.count + 1 : 1;\n\n nodesDict[candidate1.id] = candidate1;\n nodesDict[candidate2.id] = candidate2;\n //updateScores();\n\n //updateCandidateStack(candidate1, candidate2);\n })\n mutable nodes = leaders.filter(d => nodesDict[d.id])\n updateScores();\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1044,"value":"addAnswer = (candidate1, candidate2) => {\n \n const ids = [candidate1.twitterId, candidate2.twitterId].sort();\n const pairId = `${ids[0]}-${ids[1]}`\n\n debugger;\n myAnswers[pairId] = {\n first: candidate1.twitterId,\n second: candidate2.twitterId\n }\n \n candidate1.score = candidate1.score || 0\n candidate2.score = candidate2.score || 0\n \n candidate1.ancestors = candidate1.ancestors || new Set();\n candidate2.ancestors = candidate2.ancestors || new Set();\n candidate1.children = candidate1.children || new Set();\n candidate2.children = candidate2.children || new Set();\n\n \n candidate2.ancestors.add(candidate1);\n candidate1.children.add(candidate2);\n \n candidate1.score = \n candidate2.score > candidate1.score \n ? candidate2.score + 1\n : candidate1.score + 1 \n ;\n \n candidate1.count = candidate1.count \n ? candidate1.count +1 : 1;\n candidate2.count = candidate2.count \n ? candidate2.count + 1 : 1;\n \n updateScores();\n \n updateCandidateStack(candidate1, candidate2);\n \n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1059,"value":"$30","pinned":false,"hidden":false,"mode":"ojs"},{"id":1093,"value":"updateCandidateStack = (candidate1, candidate2) => {\n // We will keep selecting the selected node, while there are other nodes with a higher score\n \n // We add candidate1 (selected candidate) to the stack if there are other nodes with higher score\n if (!nextCandidateStack.includes(candidate1)) {\n if (higherScoreCandidates(candidate1).length) {\n nextCandidateStack.push(candidate1)\n } \n }\n \n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1101,"value":"getNextCandidate = () => {\n // We will select a candidate from the stack (usually the node that was previously selected)\n \n // If the stack is empty, we will add a random node to the stack\n // - 50% chance: one of the candidates that have never been selected\n // - 50% chance: any of the candidates (randomly selected)\n if (!nextCandidateStack.length) {\n // 50% chance of selecting a new candidate or an existing candidate\n if (d3.randomNormal(0, 1)() > 0) {\n let newCandidates = leaders.filter(d => !nodesDict[d.id])\n newCandidates = newCandidates.length ? newCandidates : leaders;\n nextCandidateStack.push(_.sample(newCandidates));\n } else {\n nextCandidateStack.push(_.sample(leaders));\n }\n \n }\n\n return nextCandidateStack.pop();\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1297,"value":"persistProvider = {\n myProvider;\n localStorage.setItem(\"myProvider\", myProvider)\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":935,"value":"canvasImage = { \n \n /*\n Used to generate a canvas image of the Candidate Pyramid\n Currently disabled\n *\n tries;\n const canvas = html`