views:

98

answers:

5

Hi everyone,

Let say we have a class

Category
{
   ID,
   Name,
   ParentID
}

and a List

1, 'Item 1', 0
2, 'Item 2', 0
3, 'Item 3', 0
4, 'Item 1.1', 1
5, 'Item 3.1', 3
6, 'Item 1.1.1', 4
7, 'Item 2.1', 2

Can we using LINQ to render a tree like:

Item 1
 Item 1.1
  Item 1.1.1
Item 2
 Item 2.1
Item 3
 Item 3.1

Any helps is appreciated!

A: 

I don't know the UI technology you use so I'll consider you can create tree nodes manually by creating TreeNode instances

You'll need to do something like the following:

        List<Category> categories = new List<Category>()
        {
            new Category() {ID =1, Name="One", ParentID = 0},
            new Category() {ID =2, Name="Two", ParentID = 0},
            new Category() {ID =3, Name="Three", ParentID = 1},
            new Category() {ID =4, Name="Four", ParentID = 1}
        };

        ILookup<int, Category> categoriesByParentID = categories.ToLookup((category) => category.ParentID, (category) => category);

        // Start creating tree nodes from the root level
        CreateTreeNodes(categoriesByParentID, 0);
    }

    /// <summary>
    /// Creates all the child nodes belonging to a specific parent and proceeds recursively to the child nodes.
    /// </summary>
    /// <param name="categoriesByParentID">Categories lookup.</param>
    /// <param name="parentID">ID of the category which children have to be added.</param>
    /// <param name="parentNode">Tree node to which the children have to be added.</param>
    private void CreateTreeNodes(ILookup<int, Category> categoriesByParentID, int parentID, TreeNode parentNode)
    {
        IEnumerable<Category> parentChildren = categoriesByParentID[parentID];
        foreach (var childCategory in parentChildren)
        {
            TreeNode childNode = new TreeNode();
            childNode.Text = childCategory.Name;

            CreateTreeNodes(categoriesByParentID, childCategory.ID, childNode);
        }
    }
vc 74
Thanks but I don't understand what you mean. I'm a noob so if you have time, please give me an example. Thanks a lot!
NVA
What do you want to achieve: create an in memory structure of a tree or a graphical representation of your tree?
vc 74
Sry, I want to render a graphical representation in <ul><li> tree. Thanks!
NVA
Linq is not going to provide any graphical feature, you'll have to use a treeview control. What UI technology do you use: Winforms, WPF, ASP.net, Silverlight?
vc 74
I knew and all I want is just to sort the list to the right order. I wonder if we can use LINQ to do that.
NVA
I've updated the source code accordingly
vc 74
A: 

You can use recursion:

public class Category
{
    public int ID { get; set; }
    public string Name { get; set; }
    public int ParentID { get; set; }
    public List<Category> Children { get; set; }
}

class Program
{
    static void Main()
    {
        List<Category> categories = new List<Category>()
        {
            new Category () { ID = 1, Name = "Item 1", ParentID = 0},
            new Category() { ID = 2, Name = "Item 2", ParentID = 0 },
            new Category() { ID = 3, Name = "Item 3", ParentID = 0 },
            new Category() { ID = 4, Name = "Item 1.1", ParentID = 1 },
            new Category() { ID = 5, Name = "Item 3.1", ParentID = 3 },
            new Category() { ID = 6, Name = "Item 1.1.1", ParentID = 4 },
            new Category() { ID = 7, Name = "Item 2.1", ParentID = 2 }
        };

        List<Category> hierarchy = new List<Category>();                        
        hierarchy = categories
                        .Where(c => c.ParentID == 0)
                        .Select(c => new Category() { ID = c.ID, Name = c.Name, ParentID = c.ParentID, Children = GetChildren(categories, c.ID) })
                        .ToList();

        HieararchyWalk(hierarchy);            

        Console.ReadLine();
    }        

    public static List<Category> GetChildren(List<Category> categories, int parentId)
    {            
        return categories
                .Where(c => c.ParentID == parentId)
                .Select(c => new Category { ID = c.ID, Name = c.Name, ParentID = c.ParentID, Children = GetChildren(categories, c.ID) })
                .ToList();
    }

    public static void HieararchyWalk(List<Category> hierarchy)
    {
        if (hierarchy != null)
        {
            foreach (var item in hierarchy)
            {
                Console.WriteLine(string.Format("{0} {1}", item.ID, item.Name));
                HieararchyWalk(item.Children);                    
            }
        }
    }        
}
Branimir
+1  A: 

These extension methods do exactly what you want:

public static partial class LinqExtensions
{
    public class Node<T>
    {
        internal Node() { }

        public int Level { get; internal set; }
        public Node<T> Parent { get; internal set; }
        public T Item { get; internal set; }
        public IList<Node<T>> Children { get; internal set; }
    }

    public static IEnumerable<Node<T>> ByHierarchy<T>(
        this IEnumerable<T> source,
        Func<T, bool> startWith, 
        Func<T, T, bool> connectBy)
    {
        return source.ByHierarchy<T>(startWith, connectBy, null);
    }

    private static IEnumerable<Node<T>> ByHierarchy<T>(
        this IEnumerable<T> source,
        Func<T, bool> startWith,
        Func<T, T, bool> connectBy,
        Node<T> parent)
    {
        int level = (parent == null ? 0 : parent.Level + 1);

        if (source == null)
            throw new ArgumentNullException("source");

        if (startWith == null)
            throw new ArgumentNullException("startWith");

        if (connectBy == null)
            throw new ArgumentNullException("connectBy");

        foreach (T value in from   item in source
                            where  startWith(item)
                            select item)
        {
            var children = new List<Node<T>>();
            Node<T> newNode = new Node<T>
            {
                Level = level,
                Parent = parent,
                Item = value,
                Children = children.AsReadOnly()
            };

            foreach (Node<T> subNode in source.ByHierarchy<T>(possibleSub => connectBy(value, possibleSub),
                                                              connectBy, newNode))
            {
                children.Add(subNode);
            }

            yield return newNode;
        }
    }

    public static void DumpHierarchy<T>(this IEnumerable<Node<T>> nodes, Func<T, string> display)
    {
        DumpHierarchy<T>(nodes, display, 0);
    }

    private static void DumpHierarchy<T>(IEnumerable<LinqExtensions.Node<T>> nodes, Func<T, string> display, int level)
    {
        foreach (var node in nodes)
        {
            for (int i = 0; i < level; i++) Console.Write("  ");
            Console.WriteLine (display(node.Item));
            if (node.Children != null)
                DumpHierarchy(node.Children, display, level + 1);
        }
    }

}

You can use them as follows:

categories.ByHierarchy(
        cat => cat.ParentId == null, // assuming ParentId is Nullable<int>
        (parent, child) => parent.Id == child.ParentId)
     .DumpHierarchy(cat => cat.Name);
Thomas Levesque
+1  A: 

Here's the "LINQ-only" version:

Func<int, int, string[]> build = null;
build = (p, n) =>
{
    return (from x in categories
            where x.ParentID == p
            from y in new[]
            {
                "".PadLeft(n)+ x.Name
            }.Union(build(x.ID, n + 1))
            select y).ToArray();
};
var lines = build(0, 0);

Yes, it's recursive LINQ.


Per NVA's request, here's the way to make all "orphan" records become root records:

Func<IEnumerable<int>, int, string[]> build = null;
build = (ps, n) =>
{
    return (from x in categories
            where ps.Contains(x.ParentID)
            from y in new[]
    {
        "".PadLeft(n)+ x.Name
    }.Union(build(new [] { x.ID }, n + 1))
            select y).ToArray();
};

var roots = (from c in categories
             join p in categories on c.ParentID equals p.ID into gps
             where !gps.Any()
             orderby c.ParentID
             select c.ParentID).Distinct();

var lines = build(roots, 0);
Enigmativity
Thanks a lot for your helps. It works really well ^^
NVA
A: 
 public IEnumerable<HelpPageMenuItem> GetHelpPageMenuItems()
    {
        var helpPages = (from h in Context.HelpPages select new HelpPageMenuItem{HelpPageId = h.HelpPageId, ParentHelpPageId = h.ParentHelpPageId, PageContext = h.PageContext, MenuText = h.MenuText}).ToList();
        var parents = from h in helpPages where !h.ParentHelpPageId.HasValue select PopulateChildren(h, helpPages);
        return parents.ToList();
    }

    private static HelpPageMenuItem PopulateChildren(HelpPageMenuItem helpPageMenuItem, IEnumerable<HelpPageMenuItem> helpPages)
    {
        helpPageMenuItem.ChildHelpPages =
            (from h in helpPages
             where h.ParentHelpPageId == helpPageMenuItem.HelpPageId
             select PopulateChildren(h, helpPages)).ToList();

        return helpPageMenuItem;
    }
jefferychi