Dear All, I could not find any reference yet in the open sources of igraph. So I want to ask you, which algorithm do you use for vertex.disjoint.path() function in igraph ?
Are the references same with the ones in graph.maxflow() function ? ( A. V. Goldberg and R. E. Tarjan: A New Approach to the Maximum Flow Problem *Journal of the ACM* 35:921-940, 1988. M. Stoer and F. Wagner: A simple min-cut algorithm, *Journal of the ACM*, 44 585-591, 1997. ) Thank you
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
