From unknown CodePlex user on Thursday, 23 April 2009 17:25:18
Hi,
The implementation of QuickGraph.Predicates.FilteredBidirectionalGraph.InEdges(TVertex v) is causing a stack overflow:
public IEnumerable InEdges(TVertex v)
{
foreach (var edge in this.InEdges(v))
...
I think two things should change:
1) The restrictions on TGraph should be:
where TGraph : IBidirectionalGraph<TVertex, TEdge>
2) The InEdges(v) should call the BaseGraph's method, and filter the results:
public IEnumerable InEdges(TVertex v)
{
foreach (var edge in this.BaseGraph.InEdges(v))
Regards,
Jan-Willem
From unknown CodePlex user on Thursday, 23 April 2009 17:25:18
Hi, The implementation of QuickGraph.Predicates.FilteredBidirectionalGraph.InEdges(TVertex v) is causing a stack overflow: public IEnumerable InEdges(TVertex v)
{
foreach (var edge in this.InEdges(v))
...
I think two things should change:
1) The restrictions on TGraph should be:
where TGraph : IBidirectionalGraph<TVertex, TEdge>
2) The InEdges(v) should call the BaseGraph's method, and filter the results:
public IEnumerable InEdges(TVertex v)
{
foreach (var edge in this.BaseGraph.InEdges(v))
Regards,
Jan-Willem