Hi, Firstly, I would like to say thank you for supporting igraph.
So I need to use the Deep First Search algorithm from a random node and stop the algorithm when the sum of node or vertices weights in the DFS sub-graph achieve a certain limit. Could you please help me telling if it is possible with the dfs igraph function? Thank you very much! Pedro
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
