Php массив вывести как дерево

Содержание

shurinskiy / category_tree.php
вывод многомерного массива PHP методом рекурсии
2 ответа 2
create array tree from array list [duplicate]
9 Answers 9
Build a tree from a flat array in PHP [duplicate]

shurinskiy / category_tree.php

This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters

/**

* Пример кода который будет упорядочивать рекурсивно массив и превращать его в дерево по

* идентификаторам родительских элементов — при этом он работает с произвольным уровнем вложенности.

* В этом примере, предпологается использование одной корневой категории, не имеющей потомков.

**/

$v_arr = array(

array(ID = > «0», name = > «корневая», parent= > «-1»),

array(ID = > «1», name = > «первая», parent= > «0»),

array(ID = > «2», name = > «вторая», parent= > «0»),

array(ID = > «3», name = > «третья», parent= > «1»),

array(ID = > «4», name = > «четвертая», parent= > «1»),

array(ID = > «5», name = > «пятая», parent= > «2»),

array(ID = > «6», name = > «шестая», parent= > «2»),

array(ID = > «7», name = > «седьмая», parent= > «5»),

array(ID = > «8», name = > «восьмая», parent= > «5»)

);

$v_tree = array();

/**

* Построить дерево

**/

function make_tree($arr, &$tree, $par_id=-1)

foreach($arr as $item)

if($item[‘parent’] == $par_id)

if( ! is_array($tree))

$tree = array();

$tree[$item[‘ID’]] = array(

‘name’ = > $item[‘name’],

‘ID’ = > $item[‘ID’],

‘parentID’ = > $item[‘parent’]

);

make_tree($arr, $tree[$item[‘ID’]], $item[‘ID’]);

/**

* Обойти дерево и преобразовать в список

**/

function menu_output($arr)

$html = »;

foreach($arr as $value)

if(! is_array($value)) continue;

$html .= ‘ < li >‘;

$html .= $value[‘name’];

$html .= menu_output($value);

$html .= ‘ ‘;

return $html ? ‘ < ul >‘.$html.’ ‘ : »;

make_tree($v_arr, $v_tree); // построить дерево из массива

echo menu_output(array_shift($v_tree)); // избавляюсь от корневого элемента дерева, а остальное вывожу как список

Источник

вывод многомерного массива PHP методом рекурсии

Добрый день, задача такова: Дан многомерный массив, нужно вывести все элементы массива в виде дерева, каждый уровень должен начинаться с двух пробелов и новой стройки.

$tree = [ "level 1" => ["level 1.1", "level 1.2"], "level 2", "level 3" => ["level 3.1", "level 3.2" => ["level 3.2.1", "level 3.2.2"], "level 3.3"], "level 4" => ["level 4.1", "level 4.2", "level 4.3", "level 4.4"], ];

function showTree($tree) < if (is_array($tree)) < foreach ($tree as $key =>$value) < if (is_array($value)) < echo $key; >showTree($value); > echo "\n\r"; > else < echo " $tree,"; >>

2 ответа 2

для правильного формирования отступов вам нужно знать глубину рекурсии.

function printTree($data, $level = 0) < foreach($data as $k =>$v) < $isArray = is_array($v); echo str_pad('', $level*2).($isArray ? $k : $v)."\n"; if($isArray)< printTree($v, $level + 1); >> > printTree($tree);

Добавлю ещё один вариант в коллекцию ответов:

$tree = [ "level 1" => ["level 1.1", "level 1.2"], "level 2", "level 3" => ["level 3.1", "level 3.2" => ["level 3.2.1", "level 3.2.2"], "level 3.3"], "level 4" => ["level 4.1", "level 4.2", "level 4.3", "level 4.4"], ]; echo tree($tree); function tree($array, $tab = '', $result = '') < foreach ($array as $key =>$value) < if (is_array($value)) < $result .= "[$key] (array)
"; $result .= tree($value, $tab . str_repeat(' ', 4)); > else < $result .= "[$key] => $value
"; > > return $result; >

[level 1] (array) [0] => level 1.1 [1] => level 1.2 [0] => level 2 [level 3] (array) [0] => level 3.1 [level 3.2] (array) [0] => level 3.2.1 [1] => level 3.2.2 [1] => level 3.3 [level 4] (array) [0] => level 4.1 [1] => level 4.2 [2] => level 4.3 [3] => level 4.4

Источник

create array tree from array list [duplicate]

i cannot use things like nested set or things like that becoas i can add left and right values in my database. any ideas?

The arrays you have demoed do not make sense because you have duplicate keys. Did you mean to have an array of arrays or are you showing the implied meaning based on the index value?

This flat array list is one of kinds of tree store in relational database and is named Adjacency list. There are another ways to store tree in RDBMS which are described in articles like this: bitworks.software/en/2017-10-20-storing-trees-in-rdbms.html

9 Answers 9

oke this is how i solved it:

$arr = array( array('id'=>100, 'parentid'=>0, 'name'=>'a'), array('id'=>101, 'parentid'=>100, 'name'=>'a'), array('id'=>102, 'parentid'=>101, 'name'=>'a'), array('id'=>103, 'parentid'=>101, 'name'=>'a'), ); $new = array(); foreach ($arr as $a) < $new[$a['parentid']][] = $a; >$tree = createTree($new, array($arr[0])); print_r($tree); function createTree(&$list, $parent)< $tree = array(); foreach ($parent as $k=>$l) < if(isset($list[$l['id']]))< $l['children'] = createTree($list, $list[$l['id']]); >$tree[] = $l; > return $tree; >

This works well, just make sure that, if you have more than one item with parentid=0, to loop through all the items and check for parentid == 0. If that’s true, then run createTree on that item and append it to your tree array. Otherwise, this routine only works for the first item where parentid=0

Question: Is the &$list required or can it also work with $list? I believe that’s what PHP uses to pass by ref. Also, is recursion discouraged in PHP?

@JinIzzraeel If you want to pass non-objects by ref, you need the ampersand. Recursion is not discouraged in PHP.

small fix if you need more than 1 parentid[0] element 🙂

$arr = array( array('id'=>100, 'parentid'=>0, 'name'=>'a'), array('id'=>101, 'parentid'=>100, 'name'=>'a'), array('id'=>102, 'parentid'=>101, 'name'=>'a'), array('id'=>103, 'parentid'=>101, 'name'=>'a'), ); $new = array(); foreach ($arr as $a) < $new[$a['parentid']][] = $a; >$tree = createTree($new, $new[0]); // changed print_r($tree); function createTree(&$list, $parent)< $tree = array(); foreach ($parent as $k=>$l) < if(isset($list[$l['id']]))< $l['children'] = createTree($list, $list[$l['id']]); >$tree[] = $l; > return $tree; >

Any ideas how to get this one working with any parentId on the lowest level ? stackoverflow.com/questions/11942115/…

One more rework of Thunderstriker’s variant — all the logic in one function:

/** * @param array $flatList - a flat list of tree nodes; a node is an array with keys: id, parentID, name. */ function buildTree(array $flatList) < $grouped = []; foreach ($flatList as $node)< $grouped[$node['parentID']][] = $node; >$fnBuilder = function($siblings) use (&$fnBuilder, $grouped) < foreach ($siblings as $k =>$sibling) < $id = $sibling['id']; if(isset($grouped[$id])) < $sibling['children'] = $fnBuilder($grouped[$id]); >$siblings[$k] = $sibling; > return $siblings; >; return $fnBuilder($grouped[0]); > // Example: $flat = [ ['id' => 100, 'parentID' => 0, 'name' => 'root'], ['id' => 101, 'parentID' => 100, 'name' => 'ch-1'], ['id' => 102, 'parentID' => 101, 'name' => 'ch-1-1'], ['id' => 103, 'parentID' => 101, 'name' => 'ch-1-2'], ]; $tree = buildTree($flat, 'parentID', 'id'); echo json_encode($tree, JSON_PRETTY_PRINT);

I liked this example so I wrapped it in a class and made it available on github here; github.com/srayner/NavTree

@HappyCoder just add an element to the $flat, for example [‘id’=>103, ‘parentID’=>101, ‘name’=>’a’] — it’s a child of a [‘id’=>101, ‘parentID’=>100, ‘name’=>’a’] element

Based on @Vasily ‘s answer, I made an «array of instances» tree builder: gist.github.com/seniorpreacher/64adfcf4844974b568bc84bf3056c05e

Here is my adaptation from arthur’s rework:

/* Recursive branch extrusion */ function createBranch(&$parents, $children) < $tree = array(); foreach ($children as $child) < if (isset($parents[$child['id']])) < $child['children'] = $this->createBranch($parents, $parents[$child['id']]); > $tree[] = $child; > return $tree; > /* Initialization */ function createTree($flat, $root = 0) < $parents = array(); foreach ($flat as $a) < $parents[$a['parent']][] = $a; >return $this->createBranch($parents, $parents[$root]); >

I created an unusual (‘while-based’ instead of recursive) but multidimensional sorting function that walk the array until there aren’t any orphans. Here the function:

function treeze( &$a, $parent_key, $children_key ) < $orphans = true; $i; while( $orphans ) < $orphans = false; foreach( $a as $k=>$v ) < // is there $a[$k] sons? $sons = false; foreach( $a as $x=>$y ) if( isset($y[$parent_key]) and $y[$parent_key]!=false and $y[$parent_key]==$k ) < $sons=true; $orphans=true; break; >// $a[$k] is a son, without children, so i can move it if( !$sons and isset($v[$parent_key]) and $v[$parent_key]!=false ) < $a[$v[$parent_key]][$children_key][$k] = $v; unset( $a[$k] ); >> > >

Recommendation: the key of each element of the array has to be the id fo the element itself. Example:

$ARRAY = array( 1 => array( 'label' => "A" ), 2 => array( 'label' => "B" ), 3 => array( 'label' => "C" ), 4 => array( 'label' => "D" ), 5 => array( 'label' => "one", 'father' => '1' ), 6 => array( 'label' => "two", 'father' => '1' ), 7 => array( 'label' => "three", 'father' => '1' ), 8 => array( 'label' => "node 1", 'father' => '2' ), 9 => array( 'label' => "node 2", 'father' => '2' ), 10 => array( 'label' => "node 3", 'father' => '2' ), 11 => array( 'label' => "I", 'father' => '9' ), 12 => array( 'label' => "II", 'father' => '9' ), 13 => array( 'label' => "III", 'father' => '9' ), 14 => array( 'label' => "IV", 'father' => '9' ), 15 => array( 'label' => "V", 'father' => '9' ), );

Usage: the function need $a (the array), $parent_key (the name of the column where the id of the father is saved), $children_key (the name of the column where the children will be move). It returns nothing (the array is changed by reference). Example: