- public function getPaths($nodes)
- {
- $levels = $paths = array();
- // 重组数组层级
- foreach ($nodes as $id => $node)
- {
- $levels[$node['level']][$id] = $node;
- }
- for ($i = 0; $i < count($levels); $i++)
- {
- if (is_array($levels[$i]))
- {
- foreach ($levels[$i] as $level)
- {
- $id = $level['id'];
- $parent_id = $level['parent_id'];
- $parent = $paths[$parent_id];
- // 存在父级并取出附加到当前节点
- if ($parent)
- {
- $paths[$id] = $parent;
- $paths[$id][] = $level['id'];
- }
- else
- {
- $paths[$id][] = $level['id'];
- }
- }
- }
- }
- return $paths;
- }
- //该片段来自于http://www.codesnippet.cn/detail/201120137317.html
来源: http://www.codesnippet.cn/detail/201120137317.html