Hi First please forgive me my english skills - the're poor. Now the problem : I have a directed graph represented by a list of nodes. The last node is "special" ;). How to cout the number of all way's from each node to the last node on the list in linear complexity. If you need more information to solve this problem i'll write it. Thank's for all replies ;) Greet's and pozdrowienia :)

Im sorry, but asking for answers to homework/assignment problems is a no-no. It does look very much like a homework problem. Plus, it should be in the math forum.