A computer network consisting of N routers and N−1 links connecting them is given. Routers are labeled with distinct integers within the range [0..(N−1)]. Links connect routers in such a way that each distinct pair of routers is connected either by a direct link or through a path consisting of direct links. There is exactly one way to reach any router from another and the number of direct links that must be traversed is called the distance between these two routers. For example, consider the following network consisting of ten routers and nine links:
Routers 2 and 4 are connected directly, so the distance between them is 1. Routers 4 and 7 are connected through a path consisting of direct links 4−0, 0−9 and 9−7; hence the distance between them is 3.
The location of a router in the network determines how quickly a packet dispatched by that router can reach other routers. The peripherality of a router is the average distance to all other routers on the network. For example, the peripherality of router 4 in the network shown above is 2.11, because:
distance to 0: 1 distance to 1: 3 distance to 2: 1 distance to 3: 3 distance to 5: 1 distance to 6: 3 distance to 7: 3 distance to 8: 2 distance to 9: 2 average: 19/9 = 2.11
The peripherality of router 0 is 1.66 and no other router has lower peripherality.
Write a function
function solution(T);
that, given a non-empty array T consisting of N integers describing a network of N routers and N−1 links, returns the label of the router that has minimum peripherality. If there is more than one router that has minimum peripherality, the function should return the lowest label.
Array T describes a network of routers as follows:
- if T[P] = Q and P ≠ Q, then there is a direct link between routers P and Q.
For example, given the following array T consisting of ten elements:
T[0] = 9 T[1] = 1 T[2] = 4 T[3] = 9 T[4] = 0 T[5] = 4 T[6] = 8 T[7] = 9 T[8] = 0 T[9] = 1the function should return 0, because this array describes the network shown above and router 0 has minimum peripherality.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- each element of array T is an integer within the range [0..(N−1);
- there is exactly one (possibly indirect) connection between any two distinct routers.
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (n) => {
let start = n;
visited.push(n)
let children = treeMap[n];
if(!distanceMap[n]){
distanceMap[n] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[n] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[n] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
for(let i = 0; i < routerNodes.length; i++ ) {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
for(let i = 0; i < children.length; i++ ) {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
}
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
for(let j = 0; j < children.length; j++ ) {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
}
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
for(let j = 0; j < children.length; j++ ) {
let c = children[j]
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
}
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
for(let j = 0; j < children.length; j++ ) {
let c = children[j]
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
}
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
for(let i = 0; i < routerNodes.length; i++ ) {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
for(let j = 0; j < children.length; j++ ) {
let c = children[]
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
}
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
for(let j = 0; j < children.length; j++ ) {
let c = children[j];
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
}
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
for(let j = 0; j < children.length; j++ ) {
let c = children[j];
console.log(c)
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
}
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
for(let j = 0; j < children.length; j++ ) {
let c = children[j];
console.log(c)
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
}
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] 9 4 8 0 9 0 3 7 1 4 2 9 0 3 2 0 5 4 4 2 0 5 8 6 9 0 3 7 6 0 8 0 3 7 1 9
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
for(let j = 0; j < children.length; j++ ) {
let c = children[j].toString();
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
}
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
for(let j = 0; j < children.length; j++ ) {
let c = children[j].toString();
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
}
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
for(let j = 0; j < children.length; j++ ) {
let c = children[j].toString();
console.log('processing', c)
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
}
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] processing 9 processing 4 processing 8 processing 0 processing 3 processing 7 processing 1 processing 2 processing 0 processing 5 processing 6 processing 0 processing 9 processing 9 processing 0 processing 3 processing 7 processing 1 processing 9 processing 4 processing 2 processing 0 processing 5 processing 4 processing 9 processing 0 processing 3 processing 7 processing 1 processing 9 processing 2 processing 0 processing 5 processing 4 processing 9 processing 4 processing 8 processing 4 processing 2 processing 4 processing 2 processing 0 processing 5 processing 4 processing 8 processing 6 processing 0 processing 8 processing 9 processing 0 processing 3 processing 7 processing 1 processing 9 processing 6 processing 0 processing 8 processing 9 processing 4 processing 8 processing 6 processing 0 processing 3 processing 7 processing 1 processing 9 processing 4 processing 8 processing 9 processing 9 processing 9 processing 0
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
for(let j = 0; j < children.length; j++ ) {
let c = children[j].toString();
console.log('processing',)
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
}
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
/if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
//if(!distanceMap[p]){
distanceMap[p] = 0;
//}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
//if(!distanceMap[p]){
distanceMap[p] = 0;
//}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
con
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
//if(!distanceMap[p]){
distanceMap[p] = 0;
//}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
console.log(distanceMap);
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] {} {} {} {} {} {} {} {} {} {}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
console.log(distanceMap);
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] {} {} {} {} {} {} {} {} {} {}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9':
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
// if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
// if(!distanceMap[p]){
distanceMap[p] = 0;
// }
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9':
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
// if(!distanceMap[p]){
distanceMap[p] = 0;
// }
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
// if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
// }
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9': 0 } { '0': 0, '1': 0, '2': 0, '3': 0, '4': 0, '5': 0, '6': 0, '7': 0, '8': 0, '9':
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
// }
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
// if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
// }
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
// if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
// }
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9':
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
// if(!distanceMap[p]){
distanceMap[p] = 0;
// }
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
// if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
// }
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
//console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9':
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
/console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9':
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
}
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
// console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ 15, 25, 27, 25, 19, 27, 29, 25, 21, 17 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
// if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
// }
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
// console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
// if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
// }
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
// console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ 15, 25, 27, 25, 19, 27, 29, 25, 21, 17 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
// if(!distanceMap[p]){
distanceMap[p] = 0;
// }
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
// if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
// }
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
// console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ 9, 9, 9, 9, 9, 9, 9, 9, 9, 9 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
// if(!distanceMap[c]) {
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
// }
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
// console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ 15, 25, 27, 25, 19, 27, 29, 25, 21, 17 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
// console.log(distanceMap);
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ 15, 25, 27, 25, 19, 27, 29, 25, 21, 17 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(, ));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i, length));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i, routerNodes.length));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
// if(queue.length) {
calculateDistances(queue.shift())
}
};
calculateDistances(n);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i, routerNodes.length));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
// if(queue.length) {
// calculateDistances(queue.shift())
// }
};
calculateDistances(n);
console.log(queue);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i, routerNodes.length));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ 9, 4, 8 ] [ 9 ] [ 4 ] [ 9 ] [ 2, 0, 5 ] [ 4 ] [ 8 ] [ 9 ] [ 6, 0 ] [ 0, 3, 7, 1 ] [ 3, 1, 1, 1, 3, 1, 1, 1, 2, 4 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
// if(queue.length) {
// calculateDistances(queue.shift())
// }
};
calculateDistances(n);
console.log(''queue);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i, routerNodes.length));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
// if(queue.length) {
// calculateDistances(queue.shift())
// }
};
calculateDistances(n);
console.log('>>>',n , queue);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i, routerNodes.length));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] >>> 0 [ 9, 4, 8 ] >>> 1 [ 9 ] >>> 2 [ 4 ] >>> 3 [ 9 ] >>> 4 [ 2, 0, 5 ] >>> 5 [ 4 ] >>> 6 [ 8 ] >>> 7 [ 9 ] >>> 8 [ 6, 0 ] >>> 9 [ 0, 3, 7, 1 ] [ 3, 1, 1, 1, 3, 1, 1, 1, 2, 4 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, le) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
// if(queue.length) {
// calculateDistances(queue.shift())
// }
};
calculateDistances(n);
console.log('>>>',n , queue);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i, routerNodes.length));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
// if(queue.length) {
// calculateDistances(queue.shift())
// }
};
calculateDistances(n);
console.log('>>>',n , queue);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i, routerNodes.length));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
// if(queue.length) {
// calculateDistances(queue.shift())
// }
};
for(let i = 0; i < routerNodes.length; i++ ) {
}
calculateDistances(n);
console.log('>>>',n , queue);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i, routerNodes.length));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
// if(queue.length) {
// calculateDistances(queue.shift())
// }
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(n);
}
console.log('>>>',n , queue);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i, routerNodes.length));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
// if(queue.length) {
// calculateDistances(queue.shift())
// }
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(n);
}
console.log('>>>',n , queue);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i, routerNodes.length));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
// if(queue.length) {
// calculateDistances(queue.shift())
// }
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log('>>>',n , queue);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i, routerNodes.length));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] >>> 0 [] >>> 1 [] >>> 2 [] >>> 3 [] >>> 4 [] >>> 5 [] >>> 6 [] >>> 7 [] >>> 8 [] >>> 9 [] [ 15, 25, 27, 25, 19, 27, 29, 25, 21, 17 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
// if(queue.length) {
// calculateDistances(queue.shift())
// }
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log('>>>',n , queue);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i, routerNodes.length));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
// if(queue.length) {
// calculateDistances(queue.shift())
// }
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log('>>>',n , queue);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i, routerNodes.length));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
// if(queue.length) {
// calculateDistances(queue.shift())
// }
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i, routerNodes.length));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ 15, 25, 27, 25, 19, 27, 29, 25, 21, 17 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
})
// if(queue.length) {
// calculateDistances(queue.shift())
// }
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ 15, 25, 27, 25, 19, 27, 29, 25, 21, 17 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ 15, 25, 27, 25, 19, 27, 29, 25, 21, 17 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
for(let i = 0; i < routerNodes.length; i++ ) {
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if()
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i])
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap && mast)
if(!masterMap[i]) {
masterMap = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i].length === routerNodes.length) {
}
if(!masterMap[i]) {
masterMap = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
TypeError: Cannot read property 'length' of undefined at solution (solution.js:77:25) at solutionWrapper (/tmp/exec.js:402:28) at Promise.resolve.then (/tmp/exec.js:428:24) at <anonymous> at process._tickCallback (internal/process/next_tick.js:188:7) at Function.Module.runMain (module.js:686:11) at startup (bootstrap_node.js:187:16) at bootstrap_node.js:608:3stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] .length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 2, '1': 4, '2': 0, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 } { '0': 2, '1': 2, '2': 4, '3': 0, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': 1, '1': 3, '2': 1, '3': 3, '4': 0, '5': 1, '6': 3, '7': 3, '8': 2, '9': 2 } { '0': 2, '1': 4, '2': 2, '3': 4, '4': 1, '5': 0, '6': 4, '7': 4, '8': 3, '9': 3 } { '0': 2, '1': 4, '2': 4, '3': 4, '4': 3, '5': 4, '6': 0, '7': 4, '8': 1, '9': 3 } { '0': 2, '1': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 0, '8': 3, '9': 1 } { '0': 1, '1': 3, '2': 3, '3': 3, '4': 2, '5': 3, '6': 1, '7': 3, '8': 0, '9': 2 } { '0': 1, '1': 1, '2': 3, '3': 1, '4': 2, '5': 3, '6': 3, '7': 1, '8': 2, '9': 0 } [ 15, 25, 27, 25, 19, 27, 29, 25, 21, 17 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(masterMap);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(masterMap);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] {} {} {} {} {} {} {} {} {} {} [ 15, 25, 27, 25, 19, 27, 29, 25, 21, 17 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(masterMap);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] { '0': {} } { '0': {}, '1': {} } { '0': {}, '1': {}, '2': {} } { '0': {}, '1': {}, '2': {}, '3': {} } { '0': {}, '1': {}, '2': {}, '3': {}, '4': {} } { '0': {}, '1': {}, '2': {}, '3': {}, '4': {}, '5': {} } { '0': {}, '1': {}, '2': {}, '3': {}, '4': {}, '5': {}, '6': {} } { '0': {}, '1': {}, '2': {}, '3': {}, '4': {}, '5': {}, '6': {}, '7': {} } { '0': {}, '1': {}, '2': {}, '3': {}, '4': {}, '5': {}, '6': {}, '7': {}, '8': {} } { '0': {}, '1': {}, '2': {}, '3': {}, '4': {}, '5': {}, '6': {}, '7': {}, '8': {}, '9': {} } [ 15, 25, 27, 25, 19, 27, 29, 25, 21, 17 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(masterMap);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
masterMap
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(masterMap);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
masterMap[p][c] = distance;
if(!masterMap[c]) {
masterMap[c] = {}
}
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(masterMap);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distance;
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(masterMap);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distance;
masterMap[c][p] = distance;
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(masterMap);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] { '0': { '4': 2, '8': 3, '9': 1 }, '1': { '9': 9 }, '2': { '4': 11 }, '3': { '9': 5 }, '4': { '0': 2, '2': 11, '5': 13 }, '5': { '4': 13 }, '6': { '8': 15 }, '7': { '9': 7 }, '8': { '0': 3, '6': 15 }, '9': { '0': 1, '1': 9, '3': 5, '7': 7 } } { '0': { '4': 10, '8': 13, '9': 3 }, '1': { '9': 1 }, '2': { '4': 17 }, '3': { '9': 5 }, '4': { '0': 10, '2': 17, '5': 21 }, '5': { '4': 21 }, '6': { '8': 25 }, '7': { '9': 7 }, '8': { '0': 13, '6': 25 }, '9': { '0': 3, '1': 1, '3': 5, '7': 7 } } { '0': { '4': 3, '8': 11, '9': 8 }, '1': { '9': 23 }, '2': { '4': 1 }, '3': { '9': 15 }, '4': { '0': 3, '2': 1, '5': 5 }, '5': { '4': 5 }, '6': { '8': 27 }, '7': { '9': 19 }, '8': { '0': 11, '6': 27 }, '9': { '0': 8, '1': 23, '3': 15, '7': 19 } } { '0': { '4': 10, '8': 13, '9': 3 }, '1': { '9': 7 }, '2': { '4': 17 }, '3': { '9': 1 }, '4': { '0': 10, '2': 17, '5': 21 }, '5': { '4': 21 }, '6': { '8': 25 }, '7': { '9': 5 }, '8': { '0': 13, '6': 25 }, '9': { '0': 3, '1': 7, '3': 1, '7': 5 } } { '0': { '4': 2, '8': 7, '9': 5 }, '1': { '9': 16 }, '2': { '4': 1 }, '3': { '9': 10 }, '4': { '0': 2, '2': 1, '5': 3 }, '5': { '4': 3 }, '6': { '8': 19 }, '7': { '9': 13 }, '8': { '0': 7, '6': 19 }, '9': { '0': 5, '1': 16, '3': 10, '7': 13 } } { '0': { '4': 5, '8': 11, '9': 8 }, '1': { '9': 23 }, '2': { '4': 3 }, '3': { '9': 15 }, '4': { '0': 5, '2': 3, '5': 1 }, '5': { '4': 1 }, '6': { '8': 27 }, '7': { '9': 19 }, '8': { '0': 11, '6': 27 }, '9': { '0': 8, '1': 23, '3': 15, '7': 19 } } { '0': { '4': 9, '8': 3, '9': 6 }, '1': { '9': 21 }, '2': { '4': 25 }, '3': { '9': 13 }, '4': { '0': 9, '2': 25, '5': 29 }, '5': { '4': 29 }, '6': { '8': 1 }, '7': { '9': 17 }, '8': { '0': 3, '6': 1 }, '9': { '0': 6, '1': 21, '3': 13, '7': 17 } } { '0': { '4': 10, '8': 13, '9': 3 }, '1': { '9': 7 }, '2': { '4': 17 }, '3': { '9': 5 }, '4': { '0': 10, '2': 17, '5': 21 }, '5': { '4': 21 }, '6': { '8':
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distance;
masterMap[c][p] = distance;
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(masterMap);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(masterMap);
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1, '2': 2, '5': 2 }, '5': { '4': 2 }, '6': { '8': 2 }, '7': { '9': 2 }, '8': { '0': 1, '6': 2 }, '9': { '0': 1, '1': 2, '3': 2, '7': 2 } } { '0': { '4': 3, '8': 3, '9': 2 }, '1': { '9': 1 }, '2': { '4': 4 }, '3': { '9': 2 }, '4': { '0': 3, '2': 4, '5': 4 }, '5': { '4': 4 }, '6': { '8': 4 }, '7': { '9': 2 }, '8': { '0': 3, '6': 4 }, '9': { '0': 2, '1': 1, '3': 2, '7': 2 } } { '0': { '4': 2, '8': 3, '9': 3 }, '1': { '9': 4 }, '2': { '4': 1 }, '3': { '9': 4 }, '4': { '0': 2, '2': 1, '5': 2 }, '5': { '4': 2 }, '6': { '8': 4 }, '7': { '9': 4 }, '8': { '0': 3, '6': 4 }, '9': { '0': 3, '1': 4, '3': 4, '7': 4 } } { '0': { '4': 3, '8': 3, '9': 2 }, '1': { '9': 2 }, '2': { '4': 4 }, '3': { '9': 1 }, '4': { '0': 3, '2': 4, '5': 4 }, '5': { '4': 4 }, '6': { '8': 4 }, '7': { '9': 2 }, '8': { '0': 3, '6': 4 }, '9': { '0': 2, '1': 2, '3': 1, '7': 2 } } { '0': { '4': 1, '8': 2, '9': 2 }, '1': { '9': 3 }, '2': { '4': 1 }, '3': { '9': 3 }, '4': { '0': 1, '2': 1, '5': 1 }, '5': { '4': 1 }, '6': { '8': 3 }, '7': { '9': 3 }, '8': { '0': 2, '6': 3 }, '9': { '0': 2, '1': 3, '3': 3, '7': 3 } } { '0': { '4': 2, '8': 3, '9': 3 }, '1': { '9': 4 }, '2': { '4': 2 }, '3': { '9': 4 }, '4': { '0': 2, '2': 2, '5': 1 }, '5': { '4': 1 }, '6': { '8': 4 }, '7': { '9': 4 }, '8': { '0': 3, '6': 4 }, '9': { '0': 3, '1': 4, '3': 4, '7': 4 } } { '0': { '4': 3, '8': 2, '9': 3 }, '1': { '9': 4 }, '2': { '4': 4 }, '3': { '9': 4 }, '4': { '0': 3, '2': 4, '5': 4 }, '5': { '4': 4 }, '6': { '8': 1 }, '7': { '9': 4 }, '8': { '0': 2, '6': 1 }, '9': { '0': 3, '1': 4, '3': 4, '7': 4 } } { '0': { '4': 3, '8': 3, '9': 2 }, '1': { '9': 2 }, '2': { '4': 4 }, '3': { '9': 2 }, '4': { '0': 3, '2': 4, '5': 4 }, '5': { '4': 4 }, '6': { '8': 4 }, '7': { '9': 1 }, '8': { '0': 3, '6': 4 }, '9': { '0': 2, '1
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
console.log(masterMap);
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
console.log(masterMap);
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== { '0': {} } ================================================== { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1, '2': 2, '5': 2 }, '5': { '4': 2 }, '6': { '8': 2 }, '7': { '9': 2 }, '8': { '0': 1, '6': 2 }, '9': { '0': 1, '1': 2, '3': 2, '7': 2 } } ================================================== { '0': { '4': 3, '8': 3, '9': 2 }, '1': { '9': 1 }, '2': { '4': 4 }, '3': { '9': 2 }, '4': { '0': 3, '2': 4, '5': 4 }, '5': { '4': 4 }, '6': { '8': 4 }, '7': { '9': 2 }, '8': { '0': 3, '6': 4 }, '9': { '0': 2, '1': 1, '3': 2, '7': 2 } } ================================================== { '0': { '4': 2, '8': 3, '9': 3 }, '1': { '9': 4 }, '2': { '4': 1 }, '3': { '9': 4 }, '4': { '0': 2, '2': 1, '5': 2 }, '5': { '4': 2 }, '6': { '8': 4 }, '7': { '9': 4 }, '8': { '0': 3, '6': 4 }, '9': { '0': 3, '1': 4, '3': 4, '7': 4 } } ================================================== { '0': { '4': 3, '8': 3, '9': 2 }, '1': { '9': 2 }, '2': { '4': 4 }, '3': { '9': 1 }, '4': { '0': 3, '2': 4, '5': 4 }, '5': { '4': 4 }, '6': { '8': 4 }, '7': { '9': 2 }, '8': { '0': 3, '6': 4 }, '9': { '0': 2, '1': 2, '3': 1, '7': 2 } } ================================================== { '0': { '4': 1, '8': 2, '9': 2 }, '1': { '9': 3 }, '2': { '4': 1 }, '3': { '9': 3 }, '4': { '0': 1, '2': 1, '5': 1 }, '5': { '4': 1 }, '6': { '8': 3 }, '7': { '9': 3 }, '8': { '0': 2, '6': 3 }, '9': { '0': 2, '1': 3, '3': 3, '7': 3 } } ================================================== { '0': { '4': 2, '8': 3, '9': 3 }, '1': { '9': 4 }, '2': { '4': 2 }, '3': { '9': 4 }, '4': { '0': 2, '2': 2, '5': 1 }, '5': { '4': 1 }, '6': { '8': 4 }, '7': { '9': 4 }, '8': { '0': 3, '6': 4 }, '9': { '0': 3, '1': 4, '3': 4, '7': 4 } } ================================================== { '0': { '4': 3, '8': 2, '9': 3 }, '1': { '9': 4 }, '2': { '4
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1, '2': 2, '5': 2 }, '5': { '4': 2 }, '6': { '8': 2 }, '7': { '9': 2 }, '8': { '0': 1, '6': 2 }, '9': { '0': 1, '1': 2, '3': 2, '7': 2 } } ================================================== { '0': { '4': 3, '8': 3, '9': 2 }, '1': { '9': 1 }, '2': { '4': 4 }, '3': { '9': 2 }, '4': { '0': 3, '2': 4, '5': 4 }, '5': { '4': 4 }, '6': { '8': 4 }, '7': { '9': 2 }, '8': { '0': 3, '6': 4 }, '9': { '0': 2, '1': 1, '3': 2, '7': 2 } } ================================================== { '0': { '4': 2, '8': 3, '9': 3 }, '1': { '9': 4 }, '2': { '4': 1 }, '3': { '9': 4 }, '4': { '0': 2, '2': 1, '5': 2 }, '5': { '4': 2 }, '6': { '8': 4 }, '7': { '9': 4 }, '8': { '0': 3, '6': 4 }, '9': { '0': 3, '1': 4, '3': 4, '7': 4 } } ================================================== { '0': { '4': 3, '8': 3, '9': 2 }, '1': { '9': 2 }, '2': { '4': 4 }, '3': { '9': 1 }, '4': { '0': 3, '2': 4, '5': 4 }, '5': { '4': 4 }, '6': { '8': 4 }, '7': { '9': 2 }, '8': { '0': 3, '6': 4 }, '9': { '0': 2, '1': 2, '3': 1, '7': 2 } } ================================================== { '0': { '4': 1, '8': 2, '9': 2 }, '1': { '9': 3 }, '2': { '4': 1 }, '3': { '9': 3 }, '4': { '0': 1, '2': 1, '5': 1 }, '5': { '4': 1 }, '6': { '8': 3 }, '7': { '9': 3 }, '8': { '0': 2, '6': 3 }, '9': { '0': 2, '1': 3, '3': 3, '7': 3 } } ================================================== { '0': { '4': 2, '8': 3, '9': 3 }, '1': { '9': 4 }, '2': { '4': 2 }, '3': { '9': 4 }, '4': { '0': 2, '2': 2, '5': 1 }, '5': { '4': 1 }, '6': { '8': 4 }, '7': { '9': 4 }, '8': { '0': 3, '6': 4 }, '9': { '0': 3, '1': 4, '3': 4, '7': 4 } } ================================================== { '0': { '4': 3, '8': 2, '9': 3 }, '1': { '9': 4 }, '2': { '4': 4 }, '3': { '9': 4 }, '4': { '0': 3, '2': 4, '5': 4 },
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1, '2': 2, '5': 2 }, '5': { '4': 2 }, '6': { '8': 2 }, '7': { '9': 2 }, '8': { '0': 1, '6': 2 }, '9': { '0': 1, '1': 2, '3': 2, '7': 2 } } ================================================== { '0': 2, '1': 0, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': { '4': 3, '8': 3, '9': 2 }, '1': { '9': 1 }, '2': { '4': 4 }, '3': { '9': 2 }, '4': { '0': 3, '2': 4, '5': 4 }, '5': { '4': 4 }, '6': { '8': 4 }, '7': { '9': 2 }, '8': { '0': 3, '6': 4 }, '9': { '0': 2, '1': 1, '3': 2, '7': 2 } } ================================================== { '0': 2, '1': 4, '2': 0, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 } { '0': { '4': 2, '8': 3, '9': 3 }, '1': { '9': 4 }, '2': { '4': 1 }, '3': { '9': 4 }, '4': { '0': 2, '2': 1, '5': 2 }, '5': { '4': 2 }, '6': { '8': 4 }, '7': { '9': 4 }, '8': { '0': 3, '6': 4 }, '9': { '0': 3, '1': 4, '3': 4, '7': 4 } } ================================================== { '0': 2, '1': 2, '2': 4, '3': 0, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } { '0': { '4': 3, '8': 3, '9': 2 }, '1': { '9': 2 }, '2': { '4': 4 }, '3': { '9': 1 }, '4': { '0': 3, '2': 4, '5': 4 }, '5': { '4': 4 }, '6': { '8': 4 }, '7': { '9': 2 }, '8': { '0': 3, '6': 4 }, '9': { '0': 2, '1': 2, '3': 1, '7': 2 } } ================================================== { '0': 1, '1': 3, '2': 1, '3': 3, '4': 0, '5': 1, '6': 3, '7': 3, '8': 2, '9': 2 } { '0': { '4': 1, '8': 2, '9': 2 }, '1': { '9': 3 }, '2': { '4': 1 }, '3': { '9': 3 }, '4': { '0': 1, '2': 1, '5': 1 }, '5': { '4': 1 }, '6': { '8': 3 }, '7': { '9': 3 }, '8': { '0': 2, '6': 3 }, '9': { '0': 2, '1': 3,
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
consol
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
console.log('====')
console.log('====')
console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
console.log('====')
console.log(masterMap)
console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== ==== { '0': { '9': 1 }, '9': { '0': 1 } } ==== ==== { '0': { '4': 1, '9': 1 }, '4': { '0': 1 }, '9': { '0': 1 } } ==== ==== { '0': { '4': 1, '8': 1, '9': 1 }, '4': { '0': 1 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== { '0': { '4': 1, '8': 1, '9': 1 }, '3': { '9': 2 }, '4': { '0': 1 }, '8': { '0': 1 }, '9': { '0': 1, '3': 2 } } ==== ==== { '0': { '4': 1, '8': 1, '9': 1 }, '3': { '9': 2 }, '4': { '0': 1 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1, '3': 2, '7': 2 } } ==== ==== { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 2 }, '3': { '9': 2 }, '4': { '0': 1 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1, '1': 2, '3': 2, '7': 2 } } ==== ==== { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1, '2': 2 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1, '1': 2, '3': 2, '7': 2 } } ==== ==== { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1, '2': 2, '5': 2 }, '5': { '4': 2 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1, '1': 2, '3': 2, '7': 2 } } ==== ==== { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1, '2': 2, '5': 2 }, '5': { '4': 2 }, '6': { '8': 2 }, '7': { '9': 2 }, '8': { '0': 1, '6': 2 }, '9': { '0': 1, '1': 2, '3': 2, '7': 2 } } ==== { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1, '2': 2, '5': 2 }, '5': { '4': 2 }, '6': { '8': 2 }, '7': { '9': 2 }, '8': { '0': 1, '6': 2 }, '9': { '0': 1, '1': 2, '3': 2, '7': 2 } } ================================================== ==== { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 1 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1, '2': 2, '5': 2 }, '5': { '4': 2 },
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
console.log('====', c)
console.log(masterMap)
console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[p][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
console.log('====', c, p)
console.log(masterMap)
console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== ==== 9 0 { '0': { '9': 1 }, '9': { '0': 1 } } ==== ==== 4 0 { '0': { '4': 1, '9': 1 }, '4': { '0': 1 }, '9': { '0': 1 } } ==== ==== 8 0 { '0': { '4': 1, '8': 1, '9': 1 }, '4': { '0': 1 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 3 9 { '0': { '4': 1, '8': 1, '9': 1 }, '3': { '9': 2 }, '4': { '0': 1 }, '8': { '0': 1 }, '9': { '0': 1, '3': 2 } } ==== ==== 7 9 { '0': { '4': 1, '8': 1, '9': 1 }, '3': { '9': 2 }, '4': { '0': 1 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1, '3': 2, '7': 2 } } ==== ==== 1 9 { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 2 }, '3': { '9': 2 }, '4': { '0': 1 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1, '1': 2, '3': 2, '7': 2 } } ==== ==== 2 4 { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1, '2': 2 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1, '1': 2, '3': 2, '7': 2 } } ==== ==== 5 4 { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1, '2': 2, '5': 2 }, '5': { '4': 2 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1, '1': 2, '3': 2, '7': 2 } } ==== ==== 6 8 { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1, '2': 2, '5': 2 }, '5': { '4': 2 }, '6': { '8': 2 }, '7': { '9': 2 }, '8': { '0': 1, '6': 2 }, '9': { '0': 1, '1': 2, '3': 2, '7': 2 } } ==== { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1, '2': 2, '5': 2 }, '5': { '4': 2 }, '6': { '8': 2 }, '7': { '9': 2 }, '8': { '0': 1, '6': 2 }, '9': { '0': 1, '1': 2, '3': 2, '7': 2 } } ================================================== ==== 9 1 { '0': { '4': 1, '8': 1, '9': 1 }, '1': { '9': 1 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0':
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
console.log('====', c, p)
console.log(masterMap)
console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
console.log('====', c, p)
console.log(masterMap)
console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== ==== 9 0 { '0': { '9': 1 }, '9': { '0': 1 } } ==== ==== 4 0 { '0': { '4': 1, '9': 1 }, '4': { '0': 1 }, '9': { '0': 1 } } ==== ==== 8 0 { '0': { '4': 1, '8': 1, '9': 1 }, '4': { '0': 1 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 3 9 { '0': { '3': 2, '4': 1, '8': 1, '9': 1 }, '3': { '9': 2 }, '4': { '0': 1 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 7 9 { '0': { '3': 2, '4': 1, '7': 2, '8': 1, '9': 1 }, '3': { '9': 2 }, '4': { '0': 1 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 1 9 { '0': { '1': 2, '3': 2, '4': 1, '7': 2, '8': 1, '9': 1 }, '1': { '9': 2 }, '3': { '9': 2 }, '4': { '0': 1 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 2 4 { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '7': 2, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 5 4 { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '7': 2, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1 }, '5': { '4': 2 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 6 8 { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1 }, '5': { '4': 2 }, '6': { '8': 2 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1 }, '5': { '4': 2 }, '6': { '8': 2 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ================================================== ==== 9 1 { '0': { '1':
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
console.log('====', c, p,)
console.log(masterMap)
console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][p] = distanceMap[c];
console.log('====', c, p, n)
console.log(masterMap)
console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== ==== 9 0 0 { '0': { '9': 1 }, '9': { '0': 1 } } ==== ==== 4 0 0 { '0': { '4': 1, '9': 1 }, '4': { '0': 1 }, '9': { '0': 1 } } ==== ==== 8 0 0 { '0': { '4': 1, '8': 1, '9': 1 }, '4': { '0': 1 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 3 9 0 { '0': { '3': 2, '4': 1, '8': 1, '9': 1 }, '3': { '9': 2 }, '4': { '0': 1 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 7 9 0 { '0': { '3': 2, '4': 1, '7': 2, '8': 1, '9': 1 }, '3': { '9': 2 }, '4': { '0': 1 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 1 9 0 { '0': { '1': 2, '3': 2, '4': 1, '7': 2, '8': 1, '9': 1 }, '1': { '9': 2 }, '3': { '9': 2 }, '4': { '0': 1 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 2 4 0 { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '7': 2, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 5 4 0 { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '7': 2, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1 }, '5': { '4': 2 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 6 8 0 { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1 }, '5': { '4': 2 }, '6': { '8': 2 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '9': 2 }, '2': { '4': 2 }, '3': { '9': 2 }, '4': { '0': 1 }, '5': { '4': 2 }, '6': { '8': 2 }, '7': { '9': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ================================================== ==== 9 1
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
console.log('====', c, p, n)
console.log(masterMap)
console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== ==== 9 0 0 { '0': { '9': 1 }, '9': { '0': 1 } } ==== ==== 4 0 0 { '0': { '4': 1, '9': 1 }, '4': { '0': 1 }, '9': { '0': 1 } } ==== ==== 8 0 0 { '0': { '4': 1, '8': 1, '9': 1 }, '4': { '0': 1 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 3 9 0 { '0': { '3': 2, '4': 1, '8': 1, '9': 1 }, '3': { '0': 2 }, '4': { '0': 1 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 7 9 0 { '0': { '3': 2, '4': 1, '7': 2, '8': 1, '9': 1 }, '3': { '0': 2 }, '4': { '0': 1 }, '7': { '0': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 1 9 0 { '0': { '1': 2, '3': 2, '4': 1, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2 }, '3': { '0': 2 }, '4': { '0': 1 }, '7': { '0': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 2 4 0 { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2 }, '2': { '0': 2 }, '3': { '0': 2 }, '4': { '0': 1 }, '7': { '0': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 5 4 0 { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2 }, '2': { '0': 2 }, '3': { '0': 2 }, '4': { '0': 1 }, '5': { '0': 2 }, '7': { '0': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== ==== 6 8 0 { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2 }, '2': { '0': 2 }, '3': { '0': 2 }, '4': { '0': 1 }, '5': { '0': 2 }, '6': { '0': 2 }, '7': { '0': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ==== { '0': 0, '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2 }, '2': { '0': 2 }, '3': { '0': 2 }, '4': { '0': 1 }, '5': { '0': 2 }, '6': { '0': 2 }, '7': { '0': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ================================================== ==== 9 1
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
console.log('====', c, p, n)
console.log(masterMap)
console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = [{}]
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
console.log('====', c, p, n)
console.log(masterMap)
console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
// console.log('====', c, p, n)
/ console.log(masterMap)
console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2 }, '2': { '0': 2 }, '3': { '0': 2 }, '4': { '0': 1 }, '5': { '0': 2 }, '6': { '0': 2 }, '7': { '0': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ================================================== { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '2': { '0': 2, '1': 4 }, '3': { '0': 2, '1': 2 }, '4': { '0': 1, '1': 3 }, '5': { '0': 2, '1': 4 }, '6': { '0': 2, '1': 4 }, '7': { '0': 2, '1': 2 }, '8': { '0': 1, '1': 3 }, '9': { '0': 1, '1': 1 } } ================================================== { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '2': { '0': 2, '1': 4, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 }, '3': { '0': 2, '1': 2, '2': 4 }, '4': { '0': 1, '1': 3, '2': 1 }, '5': { '0': 2, '1': 4, '2': 2 }, '6': { '0': 2, '1': 4, '2': 4 }, '7': { '0': 2, '1': 2, '2': 4 }, '8': { '0': 1, '1': 3, '2': 3 }, '9': { '0': 1, '1': 1, '2': 3 } } ================================================== { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '2': { '0': 2, '1': 4, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 }, '3': { '0': 2, '1': 2,
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && ObmasterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && Object.keys(masterMap[i].length === routerNodes.length) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && Object.keys(masterMap[i]) === routerNodes.length - 1) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && Object.keys(masterMap[i]) === (routerNodes.length - 1)) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2 }, '2': { '0': 2 }, '3': { '0': 2 }, '4': { '0': 1 }, '5': { '0': 2 }, '6': { '0': 2 }, '7': { '0': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ================================================== { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '2': { '0': 2, '1': 4 }, '3': { '0': 2, '1': 2 }, '4': { '0': 1, '1': 3 }, '5': { '0': 2, '1': 4 }, '6': { '0': 2, '1': 4 }, '7': { '0': 2, '1': 2 }, '8': { '0': 1, '1': 3 }, '9': { '0': 1, '1': 1 } } ================================================== { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '2': { '0': 2, '1': 4, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 }, '3': { '0': 2, '1': 2, '2': 4 }, '4': { '0': 1, '1': 3, '2': 1 }, '5': { '0': 2, '1': 4, '2': 2 }, '6': { '0': 2, '1': 4, '2': 4 }, '7': { '0': 2, '1': 2, '2': 4 }, '8': { '0': 1, '1': 3, '2': 3 }, '9': { '0': 1, '1': 1, '2': 3 } } ================================================== { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '2': { '0': 2, '1': 4, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 }, '3': { '0': 2, '1': 2,
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
// if(masterMap[i] && Object.keys(masterMap[i]) === (routerNodes.length - 1)) {
return;
// }
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
// if(masterMap[i] && Object.keys(masterMap[i]) === (routerNodes.length - 1)) {
return;
// }
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(pdCalculations);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ==================================================
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
// if(masterMap[i] && Object.keys(masterMap[i]) === (routerNodes.length - 1)) {
return;
// }
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
// if(masterMap[i] && Object.keys(masterMap[i]) === (routerNodes.length - 1)) {
return;
// }
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ==================================================
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
// if(masterMap[i] && Object.keys(masterMap[i]) === (routerNodes.length - 1)) {
// return;
// }
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
// if(masterMap[i] && Object.keys(masterMap[i]) === (routerNodes.length - 1)) {
// return;
// }
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2 }, '2': { '0': 2 }, '3': { '0': 2 }, '4': { '0': 1 }, '5': { '0': 2 }, '6': { '0': 2 }, '7': { '0': 2 }, '8': { '0': 1 }, '9': { '0': 1 } } ================================================== { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '2': { '0': 2, '1': 4 }, '3': { '0': 2, '1': 2 }, '4': { '0': 1, '1': 3 }, '5': { '0': 2, '1': 4 }, '6': { '0': 2, '1': 4 }, '7': { '0': 2, '1': 2 }, '8': { '0': 1, '1': 3 }, '9': { '0': 1, '1': 1 } } ================================================== { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '2': { '0': 2, '1': 4, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 }, '3': { '0': 2, '1': 2, '2': 4 }, '4': { '0': 1, '1': 3, '2': 1 }, '5': { '0': 2, '1': 4, '2': 2 }, '6': { '0': 2, '1': 4, '2': 4 }, '7': { '0': 2, '1': 2, '2': 4 }, '8': { '0': 1, '1': 3, '2': 3 }, '9': { '0': 1, '1': 1, '2': 3 } } ================================================== { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '2': { '0': 2, '1': 4, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 }, '3': { '0': 2, '1': 2,
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
// if(masterMap[i] && Object.keys(masterMap[i]) === (routerNodes.length - 1)) {
// return;
// }
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== 90
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && Object.keys(masterMap[i]) === (routerNodes.length - 1)) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== 90
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && Object.keys(masterMap[i]) === (routerNodes.length - 1)) {
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && Object.keys(masterMap[i]) === (routerNodes.length - 1)) {
console.log('RETURN')
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== 90
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
console.log('RETURN')
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== RETURN
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================');
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ==================================================
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================', Object.keys(masterMap[i]).length);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================', Object.keys(masterMap[i]).length);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
TypeError: Cannot convert undefined or null to object at Function.keys (<anonymous>) at solution (solution.js:86:82) at solutionWrapper (/tmp/exec.js:402:28) at Promise.resolve.then (/tmp/exec.js:428:24) at <anonymous> at process._tickCallback (internal/process/next_tick.js:188:7) at Function.Module.runMain (module.js:686:11) at startup (bootstrap_node.js:187:16) at bootstrap_node.js:608:3stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================', bject.keys(masterMap[i]).length);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================', masterMap[i]);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== undefined ================================================== { '0': 2 } ================================================== { '0': 2, '1': 4 } ================================================== { '0': 2, '1': 2, '2': 4 } ================================================== { '0': 1, '1': 3, '2': 1, '3': 3 } ================================================== { '0': 2, '1': 4, '2': 2, '3': 4, '4': 1 } ================================================== { '0': 2, '1': 4, '2': 4, '3': 4, '4': 3, '5': 4 } ================================================== { '0': 2, '1': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4 } ================================================== { '0': 1, '1': 3, '2': 3, '3': 3, '4': 2, '5': 3, '6': 1, '7': 3 } ================================================== { '0': 1, '1': 1, '2': 3, '3': 1, '4': 2, '5': 3, '6': 3, '7': 1, '8': 2 }
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================', masterMap[i].);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================', masterMap[i].length);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================', masterMap[i].length);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
// return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
TypeError: Cannot read property 'length' of undefined at solution (solution.js:86:88) at solutionWrapper (/tmp/exec.js:402:28) at Promise.resolve.then (/tmp/exec.js:428:24) at <anonymous> at process._tickCallback (internal/process/next_tick.js:188:7) at Function.Module.runMain (module.js:686:11) at startup (bootstrap_node.js:187:16) at bootstrap_node.js:608:3stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
// return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
masterMap[i].length
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
// return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
masterMap[i].length
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== 90
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
// return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
console.log(masterMap[i].length)
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== undefined ================================================== undefined ================================================== undefined ================================================== undefined ================================================== undefined ================================================== undefined ================================================== undefined ================================================== undefined ================================================== undefined ================================================== undefined 90
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
// return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
console.log(ObmasterMap[i].length)
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
// return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
console.log(Object.values(masterMap[i]).length)
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== 0 ================================================== 1 ================================================== 2 ================================================== 3 ================================================== 4 ================================================== 5 ================================================== 6 ================================================== 7 ================================================== 8 ================================================== 9 90
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
// return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
console.log(Object.values(masterMap[i]))
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
// return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
console.log(Object.values(masterMap[i]))
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== [] ================================================== [ 2 ] ================================================== [ 2, 4 ] ================================================== [ 2, 2, 4 ] ================================================== [ 1, 3, 1, 3 ] ================================================== [ 2, 4, 2, 4, 1 ] ================================================== [ 2, 4, 4, 4, 3, 4 ] ================================================== [ 2, 2, 4, 2, 3, 4, 4 ] ================================================== [ 1, 3, 3, 3, 2, 3, 1, 3 ] ================================================== [ 1, 1, 3, 1, 2, 3, 3, 1, 2 ] 90
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
// return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
console.log(Obj(masterMap[i]))
pdCalculations.push(calcs(i));
// console.log(masterMap);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
// return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
// console.log(masterMap[i])
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
// return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
pdCalculations.push(calcs(i));
console.log(masterMap[i])
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } ================================================== { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } ================================================== { '0': 2, '1': 4, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 } ================================================== { '0': 2, '1': 2, '2': 4, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } ================================================== { '0': 1, '1': 3, '2': 1, '3': 3, '5': 1, '6': 3, '7': 3, '8': 2, '9': 2 } ================================================== { '0': 2, '1': 4, '2': 2, '3': 4, '4': 1, '6': 4, '7': 4, '8': 3, '9': 3 } ================================================== { '0': 2, '1': 4, '2': 4, '3': 4, '4': 3, '5': 4, '7': 4, '8': 1, '9': 3 } ================================================== { '0': 2, '1': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '8': 3, '9': 1 } ================================================== { '0': 1, '1': 3, '2': 3, '3': 3, '4': 2, '5': 3, '6': 1, '7': 3, '9': 2 } ================================================== { '0': 1, '1': 1, '2': 3, '3': 1, '4': 2, '5': 3, '6': 3, '7': 1, '8': 2 } 90
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
// return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
console.log(masterMap[i])
pdCalculations.push(calcs(i));
console.log(masterMap[i])
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== {} { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 } ================================================== { '0': 2 } { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } ================================================== { '0': 2, '1': 4 } { '0': 2, '1': 4, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 } ================================================== { '0': 2, '1': 2, '2': 4 } { '0': 2, '1': 2, '2': 4, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 } ================================================== { '0': 1, '1': 3, '2': 1, '3': 3 } { '0': 1, '1': 3, '2': 1, '3': 3, '5': 1, '6': 3, '7': 3, '8': 2, '9': 2 } ================================================== { '0': 2, '1': 4, '2': 2, '3': 4, '4': 1 } { '0': 2, '1': 4, '2': 2, '3': 4, '4': 1, '6': 4, '7': 4, '8': 3, '9': 3 } ================================================== { '0': 2, '1': 4, '2': 4, '3': 4, '4': 3, '5': 4 } { '0': 2, '1': 4, '2': 4, '3': 4, '4': 3, '5': 4, '7': 4, '8': 1, '9': 3 } ================================================== { '0': 2, '1': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4 } { '0': 2, '1': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '8': 3, '9': 1 } ================================================== { '0': 1, '1': 3, '2': 3, '3': 3, '4': 2, '5': 3, '6': 1, '7': 3 } { '0': 1, '1': 3, '2': 3, '3': 3, '4': 2, '5': 3, '6': 1, '7': 3, '9': 2 } ================================================== { '0': 1, '1': 1, '2': 3, '3': 1, '4': 2, '5': 3, '6': 3, '7': 1, '8': 2 } { '0': 1, '1': 1, '2': 3, '3': 1, '4': 2, '5': 3, '6': 3, '7': 1, '8': 2 } 90
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN')
// return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
console.log(masterMap[i])
pdCalculations.push(calcs(i));
console.log(masterMap[i])
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
console.log('RETURN')
console.log(masterMap[i])
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
console.log('RETURN')
console.log(masterMap[i])
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== {} ================================================== { '0': 2 } ================================================== { '0': 2, '1': 4 } ================================================== { '0': 2, '1': 2, '2': 4 } ================================================== { '0': 1, '1': 3, '2': 1, '3': 3 } ================================================== { '0': 2, '1': 4, '2': 2, '3': 4, '4': 1 } ================================================== { '0': 2, '1': 4, '2': 4, '3': 4, '4': 3, '5': 4 } ================================================== { '0': 2, '1': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4 } ================================================== { '0': 1, '1': 3, '2': 3, '3': 3, '4': 2, '5': 3, '6': 1, '7': 3 } ================================================== RETURN { '0': 1, '1': 1, '2': 3, '3': 1, '4': 2, '5': 3, '6': 3, '7': 1, '8': 2 }
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
console.log('RETURN')
console.log(masterMap[i])
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== RETURN { '0': 1, '1': 1, '2': 3, '3': 1, '4': 2, '5': 3, '6': 3, '7': 1, '8': 2 }
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
console.log('RETURN')
// console.log(masterMap[i])
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
console.log('RETURN')
// console.log(masterMap[i])
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== RETURN
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
console.log('RETURN', runs)
// console.log(masterMap[i])
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== RETURN 81
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
/ distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
console.log('RETURN', runs)
// console.log(masterMap[i])
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
console.log('RETURN', runs)
// console.log(masterMap[i])
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== ================================================== RETURN 81
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
// console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN', runs)
//
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
console.log(masterMap[i])
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
// console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN', runs)
//
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
console.log(masterMap[i])
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
// console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN', runs)
//
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
console.log(masterMap)
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
// console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN', runs)
//
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
console.log(pdCalculations)
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
// console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN', runs)
//
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
console.log(mas)
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
// console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN', runs)
//
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
console.log(masterMap)
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
// console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
console.log('RETURN', runs)
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
console.log(masterMap)
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
// console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
console.log('RETURN', masterMap)
return;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
console.log(masterMap)
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] RETURN { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '2': { '0': 2, '1': 4, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 }, '3': { '0': 2, '1': 2, '2': 4, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '4': { '0': 1, '1': 3, '2': 1, '3': 3, '5': 1, '6': 3, '7': 3, '8': 2, '9': 2 }, '5': { '0': 2, '1': 4, '2': 2, '3': 4, '4': 1, '6': 4, '7': 4, '8': 3, '9': 3 }, '6': { '0': 2, '1': 4, '2': 4, '3': 4, '4': 3, '5': 4, '7': 4, '8': 1, '9': 3 }, '7': { '0': 2, '1': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '8': 3, '9': 1 }, '8': { '0': 1, '1': 3, '2': 3, '3': 3, '4': 2, '5': 3, '6': 1, '7': 3, '9': 2 }, '9': { '0': 1, '1': 1, '2': 3, '3': 1, '4': 2, '5': 3, '6': 3, '7': 1, '8': 2 } }
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
// console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
console.log('RETURN', masterMap)
b;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
console.log(masterMap)
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
// console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
console.log('RETURN', masterMap)
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
console.log(masterMap)
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] RETURN { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '2': { '0': 2, '1': 4, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 }, '3': { '0': 2, '1': 2, '2': 4, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '4': { '0': 1, '1': 3, '2': 1, '3': 3, '5': 1, '6': 3, '7': 3, '8': 2, '9': 2 }, '5': { '0': 2, '1': 4, '2': 2, '3': 4, '4': 1, '6': 4, '7': 4, '8': 3, '9': 3 }, '6': { '0': 2, '1': 4, '2': 4, '3': 4, '4': 3, '5': 4, '7': 4, '8': 1, '9': 3 }, '7': { '0': 2, '1': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '8': 3, '9': 1 }, '8': { '0': 1, '1': 3, '2': 3, '3': 3, '4': 2, '5': 3, '6': 1, '7': 3, '9': 2 }, '9': { '0': 1, '1': 1, '2': 3, '3': 1, '4': 2, '5': 3, '6': 3, '7': 1, '8': 2 } } { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '2': { '0': 2, '1': 4, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 }, '3': { '0': 2, '1': 2, '2': 4, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '4': { '0': 1, '1': 3, '2': 1, '3': 3, '5': 1, '6': 3, '7': 3, '8': 2, '9': 2 }, '5': { '0': 2, '1': 4, '2': 2, '3': 4, '4': 1, '6': 4, '7': 4,
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
// console.log('==================================================',);
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
// console.log('RETURN', masterMap)
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
console.log(masterMap)
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] { '0': { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, '1': { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '2': { '0': 2, '1': 4, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 }, '3': { '0': 2, '1': 2, '2': 4, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, '4': { '0': 1, '1': 3, '2': 1, '3': 3, '5': 1, '6': 3, '7': 3, '8': 2, '9': 2 }, '5': { '0': 2, '1': 4, '2': 2, '3': 4, '4': 1, '6': 4, '7': 4, '8': 3, '9': 3 }, '6': { '0': 2, '1': 4, '2': 4, '3': 4, '4': 3, '5': 4, '7': 4, '8': 1, '9': 3 }, '7': { '0': 2, '1': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '8': 3, '9': 1 }, '8': { '0': 1, '1': 3, '2': 3, '3': 3, '4': 2, '5': 3, '6': 1, '7': 3, '9': 2 }, '9': { '0': 1, '1': 1, '2': 3, '3': 1, '4': 2, '5': 3, '6': 3, '7': 1, '8': 2 } } 81
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
console.log(masterMap)
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = {};
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
console.log(masterMap)
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
console.log(masterMap)
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, { '0': 2, '1': 4, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 }, { '0': 2, '1': 2, '2': 4, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, { '0': 1, '1': 3, '2': 1, '3': 3, '5': 1, '6': 3, '7': 3, '8': 2, '9': 2 }, { '0': 2, '1': 4, '2': 2, '3': 4, '4': 1, '6': 4, '7': 4, '8': 3, '9': 3 }, { '0': 2, '1': 4, '2': 4, '3': 4, '4': 3, '5': 4, '7': 4, '8': 1, '9': 3 }, { '0': 2, '1': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '8': 3, '9': 1 }, { '0': 1, '1': 3, '2': 3, '3': 3, '4': 2, '5': 3, '6': 1, '7': 3, '9': 2 }, { '0': 1, '1': 1, '2': 3, '3': 1, '4': 2, '5': 3, '6': 3, '7': 1, '8': 2 } ] 81
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
pdCalculations.push(calcs(i));
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
calcs(i);
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] 81
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
calcs(i);
}
console.log
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
calcs(i);
}
console.log(masterMap)
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, { '0': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, { '0': 2, '1': 4, '3': 4, '4': 1, '5': 2, '6': 4, '7': 4, '8': 3, '9': 3 }, { '0': 2, '1': 2, '2': 4, '4': 3, '5': 4, '6': 4, '7': 2, '8': 3, '9': 1 }, { '0': 1, '1': 3, '2': 1, '3': 3, '5': 1, '6': 3, '7': 3, '8': 2, '9': 2 }, { '0': 2, '1': 4, '2': 2, '3': 4, '4': 1, '6': 4, '7': 4, '8': 3, '9': 3 }, { '0': 2, '1': 4, '2': 4, '3': 4, '4': 3, '5': 4, '7': 4, '8': 1, '9': 3 }, { '0': 2, '1': 2, '2': 4, '3': 2, '4': 3, '5': 4, '6': 4, '8': 3, '9': 1 }, { '0': 1, '1': 3, '2': 3, '3': 3, '4': 2, '5': 3, '6': 1, '7': 3, '9': 2 }, { '0': 1, '1': 1, '2': 3, '3': 1, '4': 2, '5': 3, '6': 3, '7': 1, '8': 2 } ] 81
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; )
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; i ++ )
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; i++ ) {
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
pdaCalculations.push(masterMap())
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = {}
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
pdaCalculations.push(Object.values(masterMap[k]))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
pdaCalculations.push(Object.values(masterMap[k]))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
pdaCalculations.push(Object.values(masterMap[k]))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
ReferenceError: pdaCalculations is not defined at solution (solution.js:97:12) at solutionWrapper (/tmp/exec.js:402:28) at Promise.resolve.then (/tmp/exec.js:428:24) at <anonymous> at process._tickCallback (internal/process/next_tick.js:188:7) at Function.Module.runMain (module.js:686:11) at startup (bootstrap_node.js:187:16) at bootstrap_node.js:608:3stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
// pdaCalculations.push(Object.values(masterMap[k]))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
// pdaCalculations.push(Object.values(masterMap[k]))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(runs);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] 81
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = {}
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
// pdaCalculations.push(Object.values(masterMap[k]))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(masterMap);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ { '1': 2, '2': 2, '3': 2, '4': 1, '5': 2, '6': 2, '7': 2, '8': 1, '9': 1 }, [ 2, <1 empty item>, 4, 2, 3, 4, 4, 2, 3, 1 ], [ 2, 4, <1 empty item>, 4, 1, 2, 4, 4, 3, 3 ], [ 2, 2, 4, <1 empty item>, 3, 4, 4, 2, 3, 1 ], [ 1, 3, 1, 3, <1 empty item>, 1, 3, 3, 2, 2 ], [ 2, 4, 2, 4, 1, <1 empty item>, 4, 4, 3, 3 ], [ 2, 4, 4, 4, 3, 4, <1 empty item>, 4, 1, 3 ], [ 2, 2, 4, 2, 3, 4, 4, <1 empty item>, 3, 1 ], [ 1, 3, 3, 3, 2, 3, 1, 3, <1 empty item>, 2 ], [ 1, 1, 3, 1, 2, 3, 3, 1, 2 ] ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = []
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
// pdaCalculations.push(Object.values(masterMap[k]))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(masterMap);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ [ <1 empty item>, 2, 2, 2, 1, 2, 2, 2, 1, 1 ], [ 2, <1 empty item>, 4, 2, 3, 4, 4, 2, 3, 1 ], [ 2, 4, <1 empty item>, 4, 1, 2, 4, 4, 3, 3 ], [ 2, 2, 4, <1 empty item>, 3, 4, 4, 2, 3, 1 ], [ 1, 3, 1, 3, <1 empty item>, 1, 3, 3, 2, 2 ], [ 2, 4, 2, 4, 1, <1 empty item>, 4, 4, 3, 3 ], [ 2, 4, 4, 4, 3, 4, <1 empty item>, 4, 1, 3 ], [ 2, 2, 4, 2, 3, 4, 4, <1 empty item>, 3, 1 ], [ 1, 3, 3, 3, 2, 3, 1, 3, <1 empty item>, 2 ], [ 1, 1, 3, 1, 2, 3, 3, 1, 2 ] ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
// pdaCalculations.push(Object.values(masterMap[k]))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(masterMap);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n, length) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
masterMap[i][i] = 0
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
// pdaCalculations.push(Object.values(masterMap[k]))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(masterMap);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ [ 0, 2, 2, 2, 1, 2, 2, 2, 1, 1 ], [ 2, <1 empty item>, 4, 2, 3, 4, 4, 2, 3, 1 ], [ 2, 4, <1 empty item>, 4, 1, 2, 4, 4, 3, 3 ], [ 2, 2, 4, <1 empty item>, 3, 4, 4, 2, 3, 1 ], [ 1, 3, 1, 3, <1 empty item>, 1, 3, 3, 2, 2 ], [ 2, 4, 2, 4, 1, <1 empty item>, 4, 4, 3, 3 ], [ 2, 4, 4, 4, 3, 4, <1 empty item>, 4, 1, 3 ], [ 2, 2, 4, 2, 3, 4, 4, <1 empty item>, 3, 1 ], [ 1, 3, 3, 3, 2, 3, 1, 3, <1 empty item>, 2 ], [ 1, 1, 3, 1, 2, 3, 3, 1, 2 ] ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
masterMap[i][i] = 0
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
// pdaCalculations.push(Object.values(masterMap[k]))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(masterMap);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
masterMap[n][p] = 0;
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
masterMap[i][i] = 0
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
// pdaCalculations.push(Object.values(masterMap[k]))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(masterMap);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
masterMap[n][p] = 0;
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
masterMap[i][i] = 0
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
// pdaCalculations.push(Object.values(masterMap[k]))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(masterMap);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ [ 0, 2, 2, 2, 1, 2, 2, 2, 1, 0 ], [ 0, 0, 4, 2, 3, 4, 4, 2, 3, 0 ], [ 0, 0, 0, 4, 1, 2, 4, 4, 3, 0 ], [ 0, 0, 0, 0, 3, 4, 4, 2, 3, 0 ], [ 0, 0, 0, 0, 0, 1, 3, 3, 2, 0 ], [ 0, 0, 0, 0, 0, 0, 4, 4, 3, 0 ], [ 0, 0, 0, 0, 0, 0, 0, 4, 1, 0 ], [ 0, 0, 0, 0, 0, 0, 0, 0, 3, 0 ], [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], [ 1, 1, 3, 1, 2, 3, 3, 1, 2 ] ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
// masterMap[n][p] = 0;
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
masterMap[i][i] = 0
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
// pdaCalculations.push(Object.values(masterMap[k]))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(masterMap);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
masterMap[n][n] = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
// masterMap[n][p] = 0;
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
masterMap[i][i] = 0
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
// pdaCalculations.push(Object.values(masterMap[k]))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(masterMap);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ [ 0, 2, 2, 2, 1, 2, 2, 2, 1, 1 ], [ 2, 0, 4, 2, 3, 4, 4, 2, 3, 1 ], [ 2, 4, 0, 4, 1, 2, 4, 4, 3, 3 ], [ 2, 2, 4, 0, 3, 4, 4, 2, 3, 1 ], [ 1, 3, 1, 3, 0, 1, 3, 3, 2, 2 ], [ 2, 4, 2, 4, 1, 0, 4, 4, 3, 3 ], [ 2, 4, 4, 4, 3, 4, 0, 4, 1, 3 ], [ 2, 2, 4, 2, 3, 4, 4, 0, 3, 1 ], [ 1, 3, 3, 3, 2, 3, 1, 3, 0, 2 ], [ 1, 1, 3, 1, 2, 3, 3, 1, 2 ] ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
masterMap[n][n] = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
// masterMap[n][p] = 0;
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
masterMap[i][i] = 0
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
pdaCalculations.push(Object.values(masterMap[k]))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(masterMap);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
masterMap[n][n] = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
// masterMap[n][p] = 0;
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
masterMap[i][i] = 0
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
pdaCalculations.push(masterMap[k].reduce((a, b)=>))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(masterMap);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
masterMap[n][n] = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
// masterMap[n][p] = 0;
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
masterMap[i][i] = 0
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
pdaCalculations.push(masterMap[k].reduce((a, b)=> a + b, 0))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(masterMap);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
ReferenceError: pdaCalculations is not defined at solution (solution.js:98:10) at solutionWrapper (/tmp/exec.js:402:28) at Promise.resolve.then (/tmp/exec.js:428:24) at <anonymous> at process._tickCallback (internal/process/next_tick.js:188:7) at Function.Module.runMain (module.js:686:11) at startup (bootstrap_node.js:187:16) at bootstrap_node.js:608:3stdout:
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
masterMap[n][n] = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
// masterMap[n][p] = 0;
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
masterMap[i][i] = 0
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
pdCalculations.push(masterMap[k].reduce((a, b)=> a + b, 0))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(masterMap);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] [ [ 0, 2, 2, 2, 1, 2, 2, 2, 1, 1 ], [ 2, 0, 4, 2, 3, 4, 4, 2, 3, 1 ], [ 2, 4, 0, 4, 1, 2, 4, 4, 3, 3 ], [ 2, 2, 4, 0, 3, 4, 4, 2, 3, 1 ], [ 1, 3, 1, 3, 0, 1, 3, 3, 2, 2 ], [ 2, 4, 2, 4, 1, 0, 4, 4, 3, 3 ], [ 2, 4, 4, 4, 3, 4, 0, 4, 1, 3 ], [ 2, 2, 4, 2, 3, 4, 4, 0, 3, 1 ], [ 1, 3, 3, 3, 2, 3, 1, 3, 0, 2 ], [ 1, 1, 3, 1, 2, 3, 3, 1, 2 ] ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
masterMap[n][n] = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
// masterMap[n][p] = 0;
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
masterMap[i][i] = 0
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
pdCalculations.push(masterMap[k].reduce((a, b)=> a + b, 0))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
masterMap[n][n] = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
// masterMap[n][p] = 0;
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
masterMap[i][i] = 0
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
pdCalculations.push(masterMap[k].reduce((a, b)=> a + b, 0))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ] 15
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
masterMap[n][n] = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
// masterMap[n][p] = 0;
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
masterMap[i][i] = 0
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
pdCalculations.push(masterMap[k].reduce((a, b)=> a + b, 0))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
// console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
masterMap[n][n] = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
// masterMap[n][p] = 0;
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
masterMap[i][i] = 0
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
pdCalculations.push(masterMap[k].reduce((a, b)=> a + b, 0))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
// console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(T) {
console.log(T);
const treeMap = {}
if(T.length < 3) {
let min = Math.min(...T);
return T.indexOf(min);
}
T.forEach((q, i)=>{
if (q === i) {
return;
}
if(!treeMap[q]) {
treeMap[q] = [];
}
if(!treeMap[i]) {
treeMap[i] = [];
}
treeMap[q].push(i);
treeMap[i].push(q)
});
// Calculate distances
const calcs = (n) => {
let distanceMap = {};
let queue = [n];
let visited = [];
let distance = 0;
masterMap[n][n] = 0;
const calculateDistances = (p) => {
let start = p;
visited.push(p)
// masterMap[n][p] = 0;
let children = treeMap[p];
if(!distanceMap[p]){
distanceMap[p] = 0;
}
children.forEach((c) => {
if(visited.indexOf(c) > -1) {
return;
}
distanceMap[c] = distanceMap[p] + 1;
// distance += distanceMap[c];
if(!masterMap[c]) {
masterMap[c] = []
}
masterMap[n][c] = distanceMap[c];
masterMap[c][n] = distanceMap[c];
runs++;
// console.log('====', c, p, n)
// console.log(masterMap)
// console.log('====')
queue.push(c)
});
};
for(let i = 0; i < routerNodes.length; i++ ) {
calculateDistances(queue.shift());
}
// console.log(distanceMap)
return distance;
}
const routerNodes = Object.keys(treeMap);
let pdCalculations = [];
let masterMap = [];
let runs = 0;
for(let i = 0; i < routerNodes.length; i++ ) {
if(masterMap[i] && Object.keys(masterMap[i]).length === (routerNodes.length - 1)) {
break;
}
if(!masterMap[i]) {
masterMap[i] = [];
masterMap[i][i] = 0
}
// console.log(masterMap[i])
calcs(i);
}
for(let k = 0; k < masterMap.length; k++ ) {
pdCalculations.push(masterMap[k].reduce((a, b)=> a + b, 0))
}
// let value = Object.keys(pdCalculations).sort((a, b) => pdCalculations[a] - pdCalculations[b])[0];
let min = Math.min.apply(null, pdCalculations);
// console.log(min);
return pdCalculations.indexOf(min);
// return parseInt(value);
}
The following issues have been detected: timeout errors.
[ 9, 1, 4, 9, 0, 4, 8, 9, 0, 1 ]
[ 0 ]
[ 0, 0 ]
[ 1, 1 ]
[ 1, 1, 1 ]
[ 1, 1, 0 ]
[ 2, 2, 2 ]
[ 3, 0, 3, 3 ]
[ 2, 2, 2, 2 ]
[ 4, 2, 2, 4, 2, 4, 2, 2 ]
[ 5, 8, 5, 1, 8, 5, 1, 0, 0, 5 ]
[ 6, 7, 7, 6, 3, 1, 2, 7 ]
[ 1, 4, 4, 1, 6, 9, 7, 9, 6, 9 ]
[ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, ... 89901 more items ]
[ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, ... 79900 more items ]
[ 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, 12345, ... 99899 more items ]
[ 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, 49999, ... 99900 more items ]
[ 816, 240, 93, 654, 109, 611, 42, 988, 608, 507, 865, 200, 434, 59, 220, 43, 493, 573, 488, 918, 724, 324, 68, 548, 851, 740, 778, 510, 258, 852, 481, 448, 597, 377, 124, 941, 553, 759, 758, 542, 997, 26, 760, 85, 627, 246, 135, 794, 526, 611, 553, 444, 314, 634, 335, 641, 12, 590, 61, 675, 280, 514, 158, 548, 460, 277, 598, 975, 563, 350, 990, 387, 270, 319, 879, 193, 608, 506, 885, 544, 153, 371, 204, 185, 64, 318, 677, 174, 243, 845, 218, 741, 777, 786, 11, 308, 574, 431, 512, 129, ... 900 more items ]
[ 1157, 2800, 2101, 18, 2915, 87, 1810, 1860, 907, 1343, 2909, 2542, 2326, 2628, 108, 2750, 2904, 2389, 779, 624, 1476, 130, 452, 1178, 203, 1429, 1588, 1863, 2046, 260, 446, 2273, 1247, 1174, 45, 1358, 2625, 2402, 1356, 570, 1288, 903, 1995, 2131, 1125, 1105, 87, 1708, 2859, 2566, 819, 1479, 1810, 74, 2147, 612, 1956, 1250, 1645, 245, 2358, 857, 1164, 1465, 203, 2107, 1513, 1330, 1628, 237, 2081, 1430, 836, 473, 1235, 2337, 2624, 2594, 2832, 1472, 1543, 505, 1906, 2739, 1575, 2597, 2042, 1996, 2716, 1859, 945, 958, 634, 888, 2497, 2013, 394, 2591, 2519, 5, ... 2900 more items ]
[ 3230, 4487, 4714, 8083, 6597, 9239, 3651, 1198, 5401, 4667, 5817, 8672, 3461, 7644, 9203, 2594, 5797, 8767, 7081, 1641, 9319, 8545, 4175, 6107, 4307, 3164, 37, 2220, 6012, 6939, 6001, 6963, 9172, 8236, 8803, 968, 5770, 7100, 5701, 1086, 6388, 9304, 6874, 8226, 1843, 1027, 2733, 7806, 1491, 3278, 9165, 658, 6573, 562, 761, 4427, 5619, 4773, 4252, 4009, 4612, 1818, 6018, 9422, 728, 5839, 5215, 2831, 5958, 9959, 8685, 2329, 4327, 7268, 5818, 6430, 1752, 682, 5806, 9569, 1374, 9996, 3333, 6994, 2462, 4988, 9019, 6411, 141, 8950, 7273, 4565, 5759, 2675, 9911, 8619, 8365, 9833, 1379, 5078, ... 9900 more items ]
[ 16847, 9376, 24057, 21534, 1816, 20701, 9140, 11829, 12409, 8000, 3252, 6726, 22401, 12143, 2072, 4729, 4728, 25444, 22424, 21320, 27773, 20046, 3685, 26114, 19832, 5771, 23048, 5972, 6076, 5793, 15239, 24354, 12068, 10092, 18827, 27103, 8211, 26929, 13399, 21858, 16582, 21283, 19964, 13496, 28799, 2067, 11409, 6499, 9831, 25064, 8985, 12348, 13045, 21839, 3958, 8022, 771, 27088, 11383, 10718, 23323, 9966, 10691, 19100, 17810, 17401, 15241, 26860, 13645, 18188, 11668, 12332, 20736, 12719, 16071, 24465, 18972, 17036, 20115, 20565, 17395, 8815, 28068, 6961, 6073, 26531, 18508, 10497, 23228, 15011, 13496, 23688, 14453, 24787, 22091, 3021, 6788, 19053, 9361, 5999, ... 29900 more items ]
[ 41901, 17184, 97291, 67520, 5802, 73854, 81719, 65789, 31527, 9274, 96166, 73404, 55156, 78045, 4956, 60355, 48769, 13552, 28557, 34184, 35087, 74426, 22640, 83196, 53283, 67229, 77955, 23866, 39590, 67192, 9205, 68036, 42069, 53744, 53816, 96761, 20682, 5080, 4614, 43891, 19513, 91980, 93317, 88965, 69747, 82529, 51648, 72034, 63133, 63989, 10064, 75084, 80532, 27701, 4693, 6006, 76685, 66365, 48561, 47340, 75552, 8402, 32583, 33543, 18632, 57895, 54553, 9870, 29355, 37858, 54900, 40313, 20456, 95408, 99122, 62015, 8322, 49294, 40591, 81471, 83498, 64872, 14106, 89011, 20220, 79197, 2559, 5244, 87020, 53620, 53745, 43335, 9355, 17768, 94635, 6054, 9367, 66359, 53519, 36700, ... 99900 more items ]