31:Ta49,betweennes = (graph, oriented) => { var Q = [], S = []; // Queue and Stack // list of predecessors on shortest paths from source var pred = Object.create(null); // distance from source var dist = Object.create(null); // number of shortest paths from source to key var sigma = Object.create(null); // dependency of source on key var delta = Object.create(null); var currentNode; var centrality = Object.create(null); graph.forEachNode(setCentralityToZero); graph.forEachNode(calculateCentrality); if (!oriented) { // The centrality scores need to be divided by two if the graph is not oriented, // since all shortest paths are considered twice Object.keys(centrality).forEach(divideByTwo); } return centrality; function divideByTwo(key) { centrality[key] /= 2; } function setCentralityToZero(node) { centrality[node.id] = 0; } function calculateCentrality(node) { currentNode = node.id; singleSourceShortestPath(currentNode); accumulate(); } function accumulate() { graph.forEachNode(setDeltaToZero); while (S.length) { var w = S.pop(); var coeff = (1 + delta[w])/sigma[w]; var predecessors = pred[w]; for (var idx = 0; idx < predecessors.length; ++idx) { var v = predecessors[idx]; delta[v] += sigma[v] * coeff; } if (w !== currentNode) { centrality[w] += delta[w]; } } } function setDeltaToZero(node) { delta[node.id] = 0; } function singleSourceShortestPath(source) { graph.forEachNode(initNode); dist[source] = 0; sigma[source] = 1; Q.push(source); while (Q.length) { var v = Q.shift(); S.push(v); graph.forEachLinkedNode(v, toId, oriented); } function toId(otherNode) { // NOTE: This code will also consider multi-edges, which are often // ignored by popular software (Gephi/NetworkX). Depending on your use // case this may not be desired and deduping needs to be performed. To // save memory I'm not deduping here... processNode(otherNode.id); } function initNode(node) { var nodeId = node.id; pred[nodeId] = []; // empty list dist[nodeId] = -1; sigma[nodeId] = 0; } function processNode(w) { // path discovery if (dist[w] === -1) { // Node w is found for the first time dist[w] = dist[v] + 1; Q.push(w); } // path counting if (dist[w] === dist[v] + 1) { // edge (v, w) on a shortest path sigma[w] += sigma[v]; pred[w].push(v); } } } }32:T48e,degree = (graph, kind) => { var getNodeDegree; var result = Object.create(null); function calculateNodeDegree(node) { var links = graph.getLinks(node.id); result[node.id] = getNodeDegree(links, node.id); } function inDegreeCalculator(links, nodeId) { var total = 0; if (!links) return total; for (var i = 0; i < links.length; i += 1) { total += (links[i].toId === nodeId) ? 1 : 0; } return total; } function outDegreeCalculator(links, nodeId) { var total = 0; if (!links) return total; for (var i = 0; i < links.length; i += 1) { total += (links[i].fromId === nodeId) ? 1 : 0; } return total; } function inoutDegreeCalculator(links) { if (!links) return 0; return links.length; } kind = (kind || 'both').toLowerCase(); if (kind === 'both' || kind === 'inout') { getNodeDegree = inoutDegreeCalculator; } else if (kind === 'in') { getNodeDegree = inDegreeCalculator; } else if (kind === 'out') { getNodeDegree = outDegreeCalculator; } else { throw new Error('Expected centrality degree kind is: in, out or both'); } graph.forEachNode(calculateNodeDegree); return result; } 33:T66d,closeness = (graph, oriented) => { var Q = []; // list of predecessors on shortest paths from source // distance from source var dist = Object.create(null); var currentNode; var centrality = Object.create(null); function setCentralityToZero(node) { centrality[node.id] = 0; } function calculateCentrality(node) { currentNode = node.id; singleSourceShortestPath(currentNode); accumulate(); } function accumulate() { // Add all distances for node to array, excluding -1s var distances = Object.keys(dist).map(function(key) {return dist[key]}).filter(function(val){return val !== -1}); // Set number of reachable nodes var reachableNodesTotal = distances.length; // Compute sum of all distances for node var totalDistance = distances.reduce(function(a,b) { return a + b }); if (totalDistance > 0) { centrality[currentNode] = ((reachableNodesTotal - 1) / totalDistance); } else { centrality[currentNode] = 0; } } function singleSourceShortestPath(source) { graph.forEachNode(initNode); dist[source] = 0; Q.push(source); while (Q.length) { var v = Q.shift(); graph.forEachLinkedNode(v, processNode, oriented); } function initNode(node) { var nodeId = node.id; dist[nodeId] = -1; } function processNode(otherNode) { var w = otherNode.id if (dist[w] === -1) { // Node w is found for the first time dist[w] = dist[v] + 1; Q.push(w); } } } graph.forEachNode(setCentralityToZero); graph.forEachNode(calculateCentrality); return centrality; }34:T4d1,eccentricity = (graph, oriented) => { var Q = []; // distance from source var dist = Object.create(null); var currentNode; var centrality = Object.create(null); function setCentralityToZero(node) { centrality[node.id] = 0; } function calculateCentrality(node) { currentNode = node.id; singleSourceShortestPath(currentNode); accumulate(); } function accumulate() { var maxDist = 0; Object.keys(dist).forEach(function (key) { var val = dist[key]; if (maxDist < val) maxDist = val; }); centrality[currentNode] = maxDist; } function singleSourceShortestPath(source) { graph.forEachNode(initNode); dist[source] = 0; Q.push(source); while (Q.length) { var v = Q.shift(); graph.forEachLinkedNode(v, processNode, oriented); } function initNode(node) { var nodeId = node.id; dist[nodeId] = -1; } function processNode(otherNode) { var w = otherNode.id if (dist[w] === -1) { // Node w is found for the first time dist[w] = dist[v] + 1; Q.push(w); } } } graph.forEachNode(setCentralityToZero); graph.forEachNode(calculateCentrality); return centrality; }35:[] 2f:{"title":"Ejemplo usando gephi","cells":[{"id":137,"value":"html`\n \n\n

Ejemplo usando gephi

\n\n

betweennes

\n \n

closeness

\n \n

degree

\n \n

eccentricity

\n \n`","pinned":true,"hidden":false,"mode":"ojs"},{"id":7,"value":"{ \n // Creamos el grafo\n let g = createGraph();\n\n // Definimos los links\n g.addLink(\"fortran\", \"c\");\n g.addLink(\"c\", \"c++\");\n g.addLink(\"c++\", \"perl\");\n g.addLink(\"c\", \"javascript\");\n\n // Calculamos las diferentes métricas\n d3.select('#betweennes').text(JSON.stringify(betweennes(g)))\n d3.select('#closeness').text(JSON.stringify(closeness(g)))\n d3.select('#degree').text(JSON.stringify(degree(g)))\n d3.select('#eccentricity').text(JSON.stringify(eccentricity(g)))\n \n \n return 'Código JS (lo mismo que el main.js del respositorio)'\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":149,"value":"md`## Código JS para la librería de Gephi\n`","pinned":false,"hidden":false,"mode":"ojs"},{"id":4,"value":"$31","pinned":false,"hidden":false,"mode":"ojs"},{"id":82,"value":"$32","pinned":false,"hidden":false,"mode":"ojs"},{"id":90,"value":"$33","pinned":false,"hidden":false,"mode":"ojs"},{"id":94,"value":"$34","pinned":false,"hidden":false,"mode":"ojs"},{"id":43,"value":"createGraph = require('https://unpkg.com/ngraph.graph@0.0.17/dist/ngraph.graph.min.js')","pinned":false,"hidden":false,"mode":"ojs"},{"id":57,"value":"d3 = require(\"d3@5\")","pinned":false,"hidden":false,"mode":"ojs"}],"files":"$W35","stdlib":"1","titling":"auto"}