I would like to know if there is a known algorithem is graph theory that finds ALL the paths to a given node from ALL the other nodes.
Follow Math Help Forum on Facebook and Google+
Look here for the problem solved between just two specific nodes. You could then loop this algorithm through all non-target nodes of the graph.
View Tag Cloud