|
From: | Tamas Nepusz |
Subject: | Re: [igraph] (no subject) |
Date: | Tue, 10 Mar 2020 17:29:15 +0100 |
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?
[Prev in Thread] | Current Thread | [Next in Thread] |