By path I mean the number of ways to get to 'D' from 'A'
the value of the end_field always follows the value of the start_field in sequence.



start_field end_field condition_field
A B .T.
B C cond2
B D cond3
C D .T.
B E cond1
E C .T.

For example
there are only 2 ways to end on 'C' starting from 'A'

With a as your start_field (a to b) [row 1]
Then with 'b' as the start_field b to c [row 2]
a->b->c

and

with a as your start_field (a to b) [row 1]
then with b as your start_field (b to e ) [row 5]
then with e as your start field (e to c) [row 6]
a->b->e->c



However in this example (the table order is irrelevant)
there are 3 ways to end on 'D' starting from 'A'


abcd
abd
abecd

I am looking for any suggestions on finding and storing these cobinations programatically.