bidirectional graph implementation

Hi.

What is the best way to represent bidirectional graph of objects?

For example, I need a reference from A->B->C and also C->B->A.

How can I search a object in such of graph? I need the serach to be as simple as possible.

Is it better to represent it as to maps, like:

Map1:

A ->B

B-> C

Map2:

C->B

B->A

Please advise.

Thanks in advanced.

[442 byte] By [nonusha] at [2007-10-2 17:02:14]