Re: General Graphs in SQL

> A
> / \
> B C
> | \ |
> F D
> |
> E
>
> Each path is assigned an id number and the steps are numbered from zero
> (the start of the path) to (k), the final step. Using the simple six
> node graph, the one edge paths are:
>
> 1 0 A
> 1 1 B
> 2 0 B
> 2 1 F
> 3 0 C
> 3 1 D
> 4 0 B
> 4 1 D
> 5 0 D
> 5 1 E

Is this incomplete on purpose? (Path AC, and the inverse paths BA, CA... are missing.) Received on Fri Dec 16 2005 - 12:47:14 CET