Hi Since the graph creates the filters, and you dont have a reference to
them, they will automatically get destroyed. You don't need to
enumerate them.
I don't think there are circular references, Only the graph has the
filter references, not vice versa.
Re: Calling destructor ... >> Something you can do, that will help, is to set references to null for ... As long as you hold references to an object, ... OP described how he had a large graph of objects and needed the ability to ... In such a scenario, setting a reference to the object to null ... (microsoft.public.dotnet.languages.csharp)
Re: destroying graph ... Since the graph creates the filters, and you dont have a reference to ...enumerate them. ... I don't think there are circular references,... (microsoft.public.win32.programmer.directx.video)
Re: maximal 3-colorable subset ...johank wrote: ... a optimisation variant of graph coloring that fixes the number ... # difficulties finding references that address such problems. ... (comp.theory)
Re: how to completely clean a graph ? ... >>> My question is then how to completely clean a Graph before releasing it? ... >>You are probably not removing the filters from the graph. ... > release the references to the filters it contains. ... (microsoft.public.win32.programmer.directx.video)
Re: White House spins "The Commander Guy" ...References you ... That's the true test of science -- ... The graph shows a scatter anywhere between 110 and 130. ... science is to consider all data, and that scatter graph has more data ... (rec.sport.golf)
