Javascript构建树层次结构

Question

var array = [{"grandpa","father"}, {"father"}, {"grandpa","father","me"}];

鉴于上面的数组,我想生成一个类似下面的java脚本对象(JSON),它具有类似父子结构.

{"id":"grandpa",
 "children":[
    {"id":"father",
     "children":[
        {"id":"me",
         "children":[]
        }]
    }]
}

Answer 1

如果您正在询问如何获取层次结构路径列表并创建树结构,那么您可以在JavaScript中执行以下操作:

function convertToHierarchy(arry /* array of array of strings */) 
{
    var item, path;

    // Discard duplicates and set up parent/child relationships
    var children = {};
    var hasParent = {};
    for (var i = 0; i < arry.length; i++) 
    {
        var path = arry[i];
        var parent = null;
        for (var j = 0; j < path.length; j++) 
        {
            var item = path[j];
            if (!children[item]) {
                children[item] = {};
            }
            if (parent) {
                children[parent][item] = true; /* dummy value */
                hasParent[item] = true;
            }
            parent = item;
        }
    }

    // Now build the hierarchy
    var result = [];
    for (item in children) {
        if (!hasParent[item]) {
            result.push(buildNodeRecursive(item, children));
        }
    }
    return result;
}

function buildNodeRecursive(item, children)
{
    var node = {id:item, children:[]};
    for (var child in children[item]) {
        node.children.push(buildNodeRecursive(child, children));
    }
    return node;
}

convertToHierarchy([["1","2"], ["1"], ["1","2","3"]]);

编辑:

你的问题仍然含糊不清.我之前的版本假设了这两件事:

1. 每个节点ID唯一地标识节点
2. 指定的层次结构路径可以从根节点以外的其他位置开始

在此示例中,我将假设以下内容:

1. 节点ID不是唯一的,但它们在特定节点的子节点中是唯一的
2. 所有层次结构路径都从树的根节点开始

这是代码:

function convertToHierarchy(arry /* array of array of strings */)
{
    // Build the node structure
    var rootNode = {id:"root", children:{}}
    for (var i = 0; i < arry.length; i++)
    {
        var path = arry[i];
        buildNodeRecursive(rootNode, path, 0);
    }
    return rootNode;
}

function buildNodeRecursive(node, path, idx)
{
    if (idx < path.length)
    {
        item = path[idx];
        if (!node.children[item])
        {
            node.children[item] = {id:item, children:{}};
        }
        buildNodeRecursive(node.children[item], path, idx + 1);
    }
}

返回层次结构,但格式有点不同.但是,你应该得到照片.