CODEWITHSUNDEEP
c#linqrecursion
user3219890
user3219890

Reputation: 417

Recursive LINQ query: select item and all children with subchildren

Is there any way to write a LINQ (or procedural style) query, that can select an item and all children with one query? I have entity:

public class Comment
{
   public int Id {get;set;}
   public int ParentId {get;set;}
   public int Text {get;set;}
}

I have an ID, so I want to select Comment with ID and all its children with subchildren. Example:

1
-2
--3
-4
-5
--6
2
3

If ID == 1 then I want list of 1,2,3,4,5,6.

Upvotes: 16

Views: 43108

Answers (3)

user3219890
user3219890

Reputation: 417

IEnumerable<Comment> GetChild(int id)
{
    return table.Where(x => x.ParentID == id || x.Id== id)
                .Union(table.Where(x => x.ParentID == id)
                            .SelectMany(y => GetChild(y.Id))
    );
}

Upvotes: 13

Branimir
Branimir

Reputation: 4367

   public class Comment
    {
        public int Id { get; set; }
        public int ParentId { get; set; }
        public string Text { get; set; }        
        public List<Comment> Children { get; set; }
    }

    class Program
    {
        static void Main()
        {
        List<Comment> categories = new List<Comment>()
            {
                new Comment () { Id = 1, Text = "Item 1", ParentId = 0},
                new Comment() { Id = 2, Text = "Item 2", ParentId = 0 },
                new Comment() { Id = 3, Text = "Item 3", ParentId = 0 },
                new Comment() { Id = 4, Text = "Item 1.1", ParentId = 1 },
                new Comment() { Id = 5, Text = "Item 3.1", ParentId = 3 },
                new Comment() { Id = 6, Text = "Item 1.1.1", ParentId = 4 },
                new Comment() { Id = 7, Text = "Item 2.1", ParentId = 2 }
            };

            List<Comment> hierarchy = new List<Comment>();
            hierarchy = categories
                            .Where(c => c.ParentId == 0)
                            .Select(c => new Comment() { 
                                  Id = c.Id, 
                                  Text = c.Text, 
                                  ParentId = c.ParentId, 
                                  Children = GetChildren(categories, c.Id) })
                            .ToList();

            HieararchyWalk(hierarchy);

            Console.ReadLine();
        }

        public static List<Comment> GetChildren(List<Comment> comments, int parentId)
        {
            return comments
                    .Where(c => c.ParentId == parentId)
                    .Select(c => new Comment { 
                        Id = c.Id, 
                        Text = c.Text, 
                        ParentId = c.ParentId, 
                        Children = GetChildren(comments, c.Id) })
                    .ToList();
        }

        public static void HieararchyWalk(List<Comment> hierarchy)
        {
            if (hierarchy != null)
            {
                foreach (var item in hierarchy)
                {
                    Console.WriteLine(string.Format("{0} {1}", item.Id, item.Text));
                    HieararchyWalk(item.Children);
                }
            }
        }

Upvotes: 24

Gimly
Gimly

Reputation: 6175

Your comment class can be seen as a graph and your problem is a Graph traversal problem.

You can't really define recursive problems through linq, but the problem can very easily be resolved by a simple recursive method.

Upvotes: 5

Related Questions