Computing directory tree depth-Based on LINQ

Source: Internet
Author: User

When a word is generated, you sometimes need to generate directories of all levels.

In this case, the depth of the directory tree needs to be calculated. There are many existing algorithms for finding the depth of the tree. This article mainly introduces a method of writing the code of LINQ. The code looks concise.

Public static int menudepth (list <menu> menulist, int parentid)
{
VaR children = menulist. Where (P => P. parentid = parentid );
If (children. Count () = 0)
Return 1;
Return 1 + children. Select (P => menudepth (menulist, P. ID). Max ();
}

 

------------

David CAI at home

Welcome to QQ to discuss any questions about word export: 371323761

Computing directory tree depth-Based on LINQ

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.