C#构建树形结构数据(全部构建,查找构建)
C#构建树形结构数据(全部构建,查找构建)
https://www.jb51.net/article/125747.html
摘要：
最近在做任务管理，任务可以无限派生子任务且没有数量限制，前端采用Easyui的Treegrid树形展示控件。
一、遇到的问题
获取全部任务拼接树形速度过慢(数据量大约在900条左右)且查询速度也并不快；
二、解决方法
1、Tree转化的JSON数据格式
a.JSON数据格式：
?| 1234567891011121314151617181920212223242526272829303132333435363738394041 | [ { "children":[ { "children":[ ], "username":"username2", "password":"password2", "id":"2", "pId":"1", "name":"节点2" }, { "children":[ ], "username":"username2", "password":"password2", "id":"A2", "pId":"1", "name":"节点2" } ], "username":"username1", "password":"password1", "id":"1", "pId":"0", "name":"节点1" }, { "children":[ ], "username":"username1", "password":"password1", "id":"A1", "pId":"0", "name":"节点1" }] |
| 1234567891011121314151617181920 | using System;using System.Collections.Generic;using System.Linq;using System.Text;using System.Threading.Tasks; namespace MyTree.Abs{ public abstract class TreeObejct { public string id { set; get; } public string pId { set; get; } public string name { set; get; } public IListnew List public virtual void Addchildren(TreeObejct node) { this.children.Add(node); } }} |
| 123456789101112131415 | using MyTree.Abs;using System;using System.Collections.Generic;using System.Linq;using System.Text;using System.Threading.Tasks; namespace MyTree.Models{ public class TreeModel : TreeObejct { public string username { set; get; } public string password { set; get; } }} |
| 123456789101112131415161718192021222324 | public static IListint number = 11){ IListnew List for (int i = 1; i < number; i++) { datas.Add(new TreeModel { id = i.ToString(), pId = (i - 1).ToString(), name = "节点" + i, username = "username" + i, password = "password" + i }); datas.Add(new TreeModel { id = "A" + i.ToString(), pId = (i - 1).ToString(), name = "节点" + i, username = "username" + i, password = "password" + i }); } return datas;} |
| 1234567891011 | private static IListprivate static IListprivate static Thread t1;private static Thread t2;static void Main(string[] args){ int count = 21; Console.WriteLine("生成任务数："+count+"个"); Console.Read();} |
| 12345678910 | public static IList{ IList foreach (var item in childrens) { item.children = GetChildrens(item); } return childrens; } |
| 1234567891011121314151617 | public static void Recursion(){ #region 递归遍历 System.Diagnostics.Stopwatch sw = new System.Diagnostics.Stopwatch(); sw.Start(); var mds_0 = models.Where(c => c.pId == "0");//获取顶级任务 foreach (var item in mds_0) { item.children = GetChildrens(item); } sw.Stop(); Console.WriteLine("----------递归遍历用时：" + sw.ElapsedMilliseconds + "----------线程名称："+t1.Name+",线程ID："+t1.ManagedThreadId); #endregion} |
| 123456789101112131415161718 | private static IListprivate static IListprivate static Thread t1;private static Thread t2;static void Main(string[] args){ int count = 1001; Console.WriteLine("生成任务数："+count+"个"); models = GetData(count); t1 = new Thread(Recursion); t1.Name = "递归遍历"; t1.Start(); Console.Read();} |
| 1234567891011121314151617181920212223242526272829303132333435 | public static void NotRecursion(){ #region 非递归遍历 System.Diagnostics.Stopwatch sw2 = new System.Diagnostics.Stopwatch(); sw2.Start(); Dictionary<string, TreeObejct> dtoMap = new Dictionary<string, TreeObejct>(); foreach (var item in models) { dtoMap.Add(item.id, item); } IListnew List foreach (var item in dtoMap.Values) { if (item.pId == "0") { result.Add(item); } else { if (dtoMap.ContainsKey(item.pId)) { dtoMap[item.pId].AddChilrden(item); } } } sw2.Stop(); Console.WriteLine("----------非递归遍历用时：" + sw2.ElapsedMilliseconds + "----------线程名称：" + t2.Name + ",线程ID：" + t2.ManagedThreadId); #endregion} |
| 12345678910111213141516171819 | private static IListprivate static IListprivate static Thread t1;private static Thread t2;static void Main(string[] args){ int count = 6; Console.WriteLine("生成任务数："+count+"个"); models = GetData(count); models2 = GetData(count); t1 = new Thread(Recursion); t2 = new Thread(NotRecursion); t1.Name = "递归遍历"; t2.Name = "非递归遍历"; t1.Start(); t2.Start(); Console.Read();} |
StackOverflowException 执行堆栈溢出发生错误时引发，通常发生非常深度或无限递归。
-:没有等到结果。
当然这个测试并不专业，但是也展示出了它的效率的确满足了当前的需求。
4、查找构建树形结果
原理同上述非递归相同，不同之处是我们通过查找的数据去构建树形
我们通过查找获取到圈中的任务,再通过当前节点获取到父级节点，因为当时没考虑到任务层级的关系，因此为添加层级编号，为此可能会有重复的存在，因此我们使用HashSet
以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持脚本之家。