使用数组创建树

Question

我将以我想要做的事开始我的问题。我有一个数组（名称列表），在我的数组中我持有对象。这些对象由人的姓名（杰克，简，詹姆斯，丹尼尔等）以及这些人相关的数组组成（杰克与丹尼尔等有关）。当然，一个人可以与多于一个人有关，但两个孩子不能关联。我想把它们留在一棵树中，我希望这棵树能够根据关系。我想从与关系最密切的人开始（例如：丹尼尔与7人有关）。我知道可能有超过1人的关系最密切。但为了简单的问题，我问，让我们只是说我知道它是谁，我会通过它作为mostRelated。

This is just an example of what I want to do

这是我有这么far.But我不知道如何进一步它。

//my array of names is nameList 
//to check who they are related to nameList.relatedTo 

function Node(names) { 
this.data = names; 
this.parent = null; 
this.children = []; 
} 

function CreateTree(nameList, mostRelated) 
{ 
this._root=mostLinked; 
    for(var i=0; i < nameList[i].length;i++) 
    { 
    node= new Node(nameList[i]); 
    if(nameList[i].isChecked!)//if already add to the tree 
    { 
     if(nameList[i].isRelated)//to check if they have any relation 
     { 
      for(var j=0; i < nameList[i].relatedTo[j].length;j++) 
      { 
       if(nameList[i].relatedTo.isChecked!) 
       { 
        nameList[i]=Node.parent; 
        Node.children.push(nameList[i].relatedTo[j]); 
        nameList[i].isChecked=true; 
        } 
      } 
     } 
    } 
    } 
} 

名称列表看起来像这样

nameList 
this.name; 
this.relatedTo=[]; 
this.related=false; 
this.checked=false; 

Answer 1

像这样的事情？你的问题从根本上要求一个图形数据结构，但它巧合地看起来像一棵树。

function Person(name) { 
    this.name = name 
    this.relatedTo = [] 
} 


function Graph(familyArr) { 
    this._familyArr = nameList.sort((a, b) => { 
    return b.relatedTo.length - a.relatedTo.length //reverse sort by relatedTo.length 
    }) 

    const familyObj = {} 
    this._familyArr.forEach(({name}) => { 
    familyObj[name] = new Person(name) //build object of name-person object key-val pairs 
    }) 
    this.head = familyObj[this._familyArr[0].name] //graphs don't have heads, but they can by 'coincidence' 
    this.family = familyObj // actual tree 
    this._children = Object.assign({}, this.family) //copies of children to keep proper track of them while building this.family 
} 

Graph.prototype.addRelative = function(parent, child) { 
    this.family[parent].relatedTo.push(this._children[child]) 
    // console.log(this.family); 
    return this 
} 

Graph.prototype.buildGraph = function() { 
    this._familyArr.forEach(parent => { 
    parent.relatedTo.forEach(child => { 
     this.addRelative(parent.name, child) 
    }) 
    }) 
} 

Graph.prototype.find = function(name) { 
    return this.family[name] 
} 

const john = {name: 'john', relatedTo: ['jane']} 
const jane = {name: 'jane', relatedTo: ['john']} 
const jack = {name: 'jack', relatedTo: ['andrew', 'jane']} 
const andrew = {name: 'andrew', relatedTo: ['jane', 'john']} 
const nameList = [john, jane, jack, andrew] 


const graph = new Graph(nameList) 
graph.buildGraph() 

console.log(graph.find('john')) 
// Person { 
// name: 'john', 
// relatedTo: [ Person { name: 'jane', relatedTo: [Object] } ] } 


console.log(graph.find('andrew')); 
// Person { 
// name: 'andrew', 
// relatedTo: 
// [ Person { name: 'jane', relatedTo: [Object] }, 
//  Person { name: 'john', relatedTo: [Object] } ] } 

console.log(graph.head) 
// Person { 
// name: 'jack', 
// relatedTo: 
// [ Person { name: 'andrew', relatedTo: [Object] }, 
//  Person { name: 'jane', relatedTo: [Object] } ] }