C#: Avoid infinite recursion when traversing object graph

Question

I have an object graph wherein each child object contains a property that refers back to its parent. Are there any good strategies for ignoring the parent references in orde

Answer 1

I'm not exactly sure what you are trying to do here but you could just maintain a hashtable with all previously visited nodes when you are doing your breadth first search of depth first search.