FLASH dynamic flow diagram

[krazl]

anyone have an idea how to build one? Here the psedo code:-

1) User put inputs; SHOULD BE DYNAMIC INPUT
2) Pointing Leads to
3) process button

so it will generate the flow chart. this the example

FROM | LEADS TO
A | H
B | C
C | I
D | B
E | K
F | B
G | H
H | L
I | G
J | K
K | G
L | I

So it will draw diagram eg;- A>H>L>I>G

pLZZ HELP. mANY THaNKs .

[krazl]

anyone have an idea how to build one? Here the psedo code:-

1) User put inputs; SHOULD BE DYNAMIC INPUT
2) Pointing Leads to
3) process button

so it will generate the flow chart. this the example

FROM | LEADS TO
A | H
B | C
C | I
D | B
E | K
F | B
G | H
H | L
I | G
J | K
K | G
L | I

So it will draw diagram eg;- A>H>L>I>G

pLZZ HELP. mANY THaNKs .

[Glen Charles Rowell]

what type of flow chart? Can u show me a sketch or different website... even just a picture from google or something

[krazl]

Originally Posted by Glen Charles Rowell

what type of flow chart? Can u show me a sketch or different website... even just a picture from google or something

here the example picture.

please help me a.s.ap. Many thanks to all..

[jsebrech]

What you want is called a graph. If you have the graphing algorithm already (the algorithm that lays out the nodes so no line crosses another line), then just post it and we'll be able to convert it to actionscript. If you don't have the algorithm, and don't understand how this should be done, well, let's just say, this is one of the harder problems in information science. There's a good book about it called graph drawing by Tollis, Batista and others.

[krazl]

Originally Posted by jsebrech

What you want is called a graph. If you have the graphing algorithm already (the algorithm that lays out the nodes so no line crosses another line), then just post it and we'll be able to convert it to actionscript. If you don't have the algorithm, and don't understand how this should be done, well, let's just say, this is one of the harder problems in information science. There's a good book about it called graph drawing by Tollis, Batista and others.

thanks for the reply. by the way, i don't have the algorithm. I have to develope without overlap using Flash coz it's very hard to develope using c#. If i have develope this graph, could i sell it?

[krazl]

anyone could help me or not?

[jsebrech]

This won't be much easier, if at all, under flash. The difficult part is the layout algorithm, which is the same in any language. I'll see tonight after work if I can find one that you might implement easily, but I have my doubts. Graph layout is very difficult.

[krazl]

Originally Posted by jsebrech

This won't be much easier, if at all, under flash. The difficult part is the layout algorithm, which is the same in any language. I'll see tonight after work if I can find one that you might implement easily, but I have my doubts. Graph layout is very difficult.

thx pal. Maybe we could start by producing an array. currently i try to produce array from table above.

A | H will produce :- A,H,L,I,G,H
B | C will produce :- I,G,H,L,I
C | I will produce :- G,H,L,I
D | B will produce :- C,I,G,H,L,I
E | K will produce :- G,H,L,I,G
F | B will produce :- C,I,G,H,L,I
G | H will produce :- L,I,G,H
H | L will produce :- I,G,H,l,I
I | G will produce :- H,L,I
J | K will produce :- G,H,L,I
K | G will produce :- H,L,I,G
L | I will produce :- G,H,L,I

aray1 = new Array("A", "H");	//, "L" , "I", "G", "H"
aray2 = new Array("B", "C");
aray3 = new Array("C", "I");
aray4 = new Array("D", "B");
aray5 = new Array("E", "K");
aray6 = new Array("F", "B");
aray7 = new Array("G", "H");
aray8 = new Array("H", "L");	//L
aray9 = new Array("I", "G");
aray10 = new Array("J", "K");
aray11 = new Array("K", "G");
aray12 = new Array("L", "I");
var berhentiDalam = 0;
var i = 0;
var ada = 0;

while ( (i++ <= 12) ){
	sementara = this["aray"+i];
	PanjangArray = sementara.length;
	
	var j = 1;
	while ( (j++ <= 12) || (berhentiDalam==0) ){	//loop for detect in which array
		sementaraDua = this["aray"+j];
		if ( (sementara[PanjangArray-1])==(sementaraDua[0]) ){	//if detect
			trace (sementara[1] + " jupe di ARRAY:- " + sementaraDua);
			huhu=sementara.length;
			trace (sementaraDua[1] + " telah dimasukkan to:- " + sementara);
			this.sementara.push(sementaraDua[1]);	
			trace (sementara + " telah dimasukkan");
			trace ("------------");
			berhentiDalam = 1;
		}
	}
	berhentiDalam = 0;
	PanjangArray = sementara.length;
	trace ("Panjang array terbaru:= " + PanjangArray);
}

H jupe di ARRAY:- H,L
L telah dimasukkan to:- A,H
A,H,L telah dimasukkan
------------
Panjang array terbaru:= 3
C jupe di ARRAY:- C,I
I telah dimasukkan to:- B,C
B,C,I telah dimasukkan
------------
Panjang array terbaru:= 3
I jupe di ARRAY:- I,G
G telah dimasukkan to:- C,I
C,I,G telah dimasukkan
------------
Panjang array terbaru:= 3
B jupe di ARRAY:- B,C,I
C telah dimasukkan to:- D,B
D,B,C telah dimasukkan
------------
Panjang array terbaru:= 3
K jupe di ARRAY:- K,G
G telah dimasukkan to:- E,K
E,K,G telah dimasukkan
------------
Panjang array terbaru:= 3
B jupe di ARRAY:- B,C,I
C telah dimasukkan to:- F,B
F,B,C telah dimasukkan
------------
Panjang array terbaru:= 3
H jupe di ARRAY:- H,L
L telah dimasukkan to:- G,H
G,H,L telah dimasukkan
------------
Panjang array terbaru:= 3
L jupe di ARRAY:- L,I
I telah dimasukkan to:- H,L
H,L,I telah dimasukkan
------------
Panjang array terbaru:= 3
G jupe di ARRAY:- G,H,L
H telah dimasukkan to:- I,G
I,G,H telah dimasukkan
------------
Panjang array terbaru:= 3
K jupe di ARRAY:- K,G
G telah dimasukkan to:- J,K
J,K,G telah dimasukkan
------------
Panjang array terbaru:= 3
G jupe di ARRAY:- G,H,L
H telah dimasukkan to:- K,G
K,G,H telah dimasukkan
------------
Panjang array terbaru:= 3
I jupe di ARRAY:- I,G,H
G telah dimasukkan to:- L,I
L,I,G telah dimasukkan
------------
Panjang array terbaru:= 3
 jupe di ARRAY:- 
 telah dimasukkan to:- 
 telah dimasukkan
------------
Panjang array terbaru:=

but the result is not what i'm expected. any expert? If we solve this one, i think we will solve harder puzzle in computer graphics.

please help anyone..

[jsebrech]

Well, you're lucky in that you want a solution in 2 dimensions, which is easier. Are there any limits on the number of connections between nodes? the lower the number of connections per node the easier it gets.

Update:
And another important thing, will it have cycles? By cycles I mean things like A -> B -> C -> A, where A leads back to A by travelling across B and C.