An algorithm for expanding nodes in the location tree after page refresh

directory tree initialization initially returns only a two-tier structure.

[
    {
      name: "",
      path: "/",
      id: 1,
      childs: 2,
      children: [
        {
           name: "01",
           path: "/01/",
           id: 2,
           childs: 2,
           children:null
        },
        {
           name: "02",
           path: "/02/",
           id: 3,
           childs: 1,
           children:null
        },
      ]
    }
]

when a node is clicked, it is expanded by whether the id and childs clicked are the child nodes under the current node 0 and add expanded: true,.
now the opening path is path: "all / first-level menu 01 / second-level menu 02 / third-level menu 04" how to match to all / first-level menu 01 / in the initialization directory tree through this path. Get children, through id to match all / first-level menu 01 / second-level menu 02 / get children, through id Match all / level 1 menus 01 / level 2 menus 02 / level 3 menus 04 in children, and expand it?

the idea is to use the path all / level 1 menus 01 / level 2 menus 02 / level 3 menus 04 to include Path in the first level matching tree.
Thank you.

Algorithm javascript

Nov.11,2021

//
let arrOrigin = [{
    name: "",
    path: "/",
    id: 1,
    childs: 2,
    children: [
        {
            name: "01",
            path: "/01/",
            id: 2,
            childs: 2,
            children: null
        },
        {
            name: "02",
            path: "/02/",
            id: 3,
            childs: 1,
            children: null
        },
    ]
}];

//
let path = "/01/02/04";

let arrPath = path.split("/");
console.log(arrPath); //

//
function render(arrOrigin, arrPath) {
    if (arrPath.length > 0) {
    //

        //
        let currentNode = arrPath.shift();

        arrOrigin.forEach(element => {
            if (element.name == currentNode) {
                // name  expanded
                element.expanded = true;
                if (element.childs > 0 && element.children) {
                    //
                    return render(element.children, arrPath);
                }
            }
        });
    }
}


render(arrOrigin, arrPath);

//
console.log(JSON.stringify(arrOrigin, null, 4));

output:

[ '', '01', '02', '04' ]
[
    {
        "name": "",
        "path": "/",
        "id": 1,
        "childs": 2,
        "children": [
            {
                "name": "01",
                "path": "/01/",
                "id": 2,
                "childs": 2,
                "children": null,
                "expanded": true
            },
            {
                "name": "02",
                "path": "/02/",
                "id": 3,
                "childs": 1,
                "children": null
            }
        ],
        "expanded": true
    }
]

Previous: How js traverses an array of arbitrary levels at any depth and converts it into html fragments

Next: Vue-cli3 import external JS file error

How does javascript find all prime factors of a number?
encounters a javascript algorithm problem, which requires that find out all prime factors of a number algorithm I designed: function primeFactors(n){ var factors = []; var divisor = 3; if (n % 2==0) factors.push(2); while(n>5){ ...

Algorithm-complexity algorithm javascript

Mar.02,2021
How does js move one element to another coordinate?
for example, if you want to move from 0 to 100 1px at this speed, you can move x coordinates + 1 per frame. What if you want to move obliquely from 0 ~ 0 to 100 ~ ~ 20 at this speed? ...

Algorithm javascript

Mar.06,2021
How does js make bullets that are good at fishing?
Let the bullets be fired according to the direction of the mouse click, just like those who are good at fishing ...

Algorithm javascript

Mar.06,2021
Find out how many zeros there are between 1 and 1 million.
find out how many zeros there are between 1 and 1 million ...

Algorithm javascript

Mar.07,2021
Problem solving of array algorithm
encounters an algorithm; similar to var a = [1 br > how to deal with it into a two-digit array [[1], [2], [4Power4], [5Power5]] < beacon > I wrote it myself: uh. how to deal with it into a two-digit array [[1], [2], [4parry 4], [5pjre 5]]. Loop twice, n...

Algorithm javascript

Mar.12,2021
Find an algorithm to select the obtained value in the reverse direction.
has a select drop-down box with five option elements with value values from 1 to 5 <select> <option value="1">1< option> <option value="2">2< option> <option value="3">3< ...

Algorithm javascript

Mar.18,2021
Js algorithm puzzle
given a non-empty array of integers, each element appears twice except for an element that appears only once. Find the element that only appears once. example 1: : [2,2,1] : 1 example 2: : [4,1,2,1,2] : 4 the answer with the highest running effici...

Algorithm javascript

Mar.18,2021
Js Array Partition problem
let arrs=[102,233,45,350,130,220,195,240] I want arrs to split into two groups, but I want the sum of the two groups to be as close as possible. The smaller the difference, the better. My own idea is to re-sort, from small to large, and then judge the s...

Algorithm javascript

Mar.22,2021
[ask Daniel for advice one or two] depth first search to find the route to the specified location, trying to print out all the routes made an error.
I want to output all possible routes, but in the end, I only output one route. I haven t figured out Orz for a long time. the following is the source code: ma mbmb.fill(0); 0 1 (x0,y0) position=[] direction=[[-1,0],[0,-1],[1,0],[0,1...

Algorithm javascript

Mar.31,2021
How to solve the stack overflow caused by the creation of segment tree by js?
use JavaScript to build a segment tree, and recursion is used in the construction process. This should make the call stack overflow. I wonder if there is any other way to solve this problem. < H1 > Code < H1 > ...

Segment-Tree data-structure-and-algorithm javascript

Apr.11,2021
Merge array object algorithm
data A: [ { "id":340, "name":"", "sub":[ { "id":341, "name":"" }, { &q...

Algorithm javascript algorithm-data-structure

Apr.29,2021
The JavaScript array is sorted in odd and even numbers, with the odd number first and the even number last. No new array is required.
for example: [1, 2, 3, 4, 5] after sorting: 1, 3, 5, 2, 4 Note: does not create a new array , that is, it is changed on the basis of the original array. ...

Algorithm javascript

May.22,2021
Php algorithm-- catching water droplets
php algorithm-- catching water droplets A novice PHP programmer, who has been on the job for half a year and is still hovering in endless additions, deletions, modifications and data optimization, has recently been brought into the algorithm pit by th...

Python algorithm javascript php

Jul.14,2021
How to determine that the values in the array are contained in each other?
there are now such data objects arr = [ {] start: 1, end: 12 }, { start: 2, end: 5 }, { start: 6, end: 10 }, . ] how to determine whether the start and end of each object are continuous for example, the above situation is incorrect, because 1-12 c...

Algorithm javascript

Mar.18,2022
Js data structure
What is the data structure corresponding to Object in js? What is its logical structure and physical structure? ...

Data-structure-and-algorithm javascript

Apr.05,2022
Given the GPS coordinates of five points, how to find the nearest gps coordinates to these points
topic description as shown in the question, if you know the GPS coordinates of five points, how to find the sixth point and minimize the sum of the distances from the other five points, and find out his GPS coordinates would like to ask if you have ...

Geographic-location algorithm javascript golang

May.26,2022