About a graph algorithm! It is very diffcult , I think!
[151 byte] By [ymq8328] at [2007-11-18 20:31:11] 
I need a method to find out All paths from a node( such as I) to another node (Such as J) in a digraph. the digraph is represented by adjacency matrix!
