|
| From: | Belavenutti Martins da Silva, Pedro |
| Subject: | [igraph] (no subject) |
| Date: | Mon, 9 Mar 2020 16:37:49 +0000 |
|
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
|
| [Prev in Thread] | Current Thread | [Next in Thread] |