Re: [jgrapht-users] DFS Question

[Welson S. <wel...@ya...>]

Since it is impossible to share my source code due to various reasons, I
have attached a very simple Java code which reproduce this problem. It
creates a graph with the same topology, and use
org._3pq.jgrapht.traverse.DepthFirstIterator to do DFS. See the .jpg for the
graph, and the DFS output is:

A
B
C
G
I
F
E
H
D  <---- This is wrong
J
K
L


Welson
 

-----Original Message-----
From: John V. Sichi [mailto:js...@gm...] 
Sent: Friday, August 04, 2006 8:01 PM
To: Welson Sun
Cc: jgr...@li...
Subject: Re: [jgrapht-users] DFS Question

Welson Sun wrote:
> I have got a DG (see attached pic), using 
> org._3pq.jgrapht.traverse.DepthFirstIterator I got the following DFS
> sequence:
> 
> START
> input
> ._2biquad.Add
> ._2biquad.b3
> ._2biquad.Add2
> ._2biquad.b
> ._2biquad.a3
> ._2biquad.Add7
> ._2biquad.a2
> ._2biquad.Add1
> output
> STOP
> 
> I don't think this sequence is correct, any insights before I dig into 
> the source code?

The sequence is not correct, but without the source code for a JUnit
testcase reproducing the problem in isolation, it's hard to say more.

JVS