But I prefer not to change the way I store the data, I think with the Id and NextId way is enough. I don't want to complicate things by using...

Bad news, cycles has to be considered =P

Let's say we have:

A->B->C->A

create table #ObjectRelations

(

Id varchar(20),

NextId varchar(20)

)

insert into #ObjectRelations values ('A', 'B')

insert into #ObjectRelations values ('B', 'C')

insert into #ObjectRelations values ('C',...

@ken: Sorry, didn't see your reply, but yes, that works! =)

This works!

create table #ObjectRelations

(

Id varchar(20),

NextId varchar(20)

)

insert into #ObjectRelations values ('G', 'B')

insert into #ObjectRelations values ('A', 'B')

insert into #ObjectRelations values ('B', 'C')

insert into #ObjectRelations values ('B', 'X')

insert into #ObjectRelations values...

So I've got this approach:

create table #ObjectRelations

(

Id varchar(20),

NextId varchar(20)

)

insert into #ObjectRelations values ('G', 'B')

insert into #ObjectRelations values ('A', 'B')

insert into #ObjectRelations values ('B', 'C')

insert into #ObjectRelations values ('B', 'X')

insert...

You're right, they're not the same thing.

It's a multi-parent tree. It doesn't have cycles and it's connected.

Sorry for the mislabeling in the topic title

Yes, that could work. I've tried that, I think I can determine the starting objects in first place...

What it's not satisfying me is that G->B is the last row and...

Hi Mike, thanks for the quick reply =P

For what I've been told on Irony forums.. it does use several 3.5 specific features, but they think your code is not using...

Is there any possibility to use this using .NET 2.0? Because our project is under 2.0 and developed using VS 2005. We can't push the whole project to 3.5 to...