Dear all, I am currently working on a network science problem with directed graphs in python. I am using the networkx library. Now, I want to find all spanning aborescences (=spanning trees in a directed graph) for a given root node. Is there any built-in or partially built-function to do so? Right now, my approach is the following (unfortunately it finds too many trees, compared to the kirchhofftheorem) : -Start with a graph G(N, E) – Calculate all permutations of edges for N-1 edges, that include the root node – create a subgraph for each edge-subset – check if all spanning aborescence criteria are met, if one of the criteria does not apply, sort the tree out.
Does anyone have an idea/approach to best find the spanning aborescences?
Thank you very much!
submitted by /u/Bright_Sprinkles_324
[link] [comments]
r/learnpython Dear all, I am currently working on a network science problem with directed graphs in python. I am using the networkx library. Now, I want to find all spanning aborescences (=spanning trees in a directed graph) for a given root node. Is there any built-in or partially built-function to do so? Right now, my approach is the following (unfortunately it finds too many trees, compared to the kirchhofftheorem) : -Start with a graph G(N, E) – Calculate all permutations of edges for N-1 edges, that include the root node – create a subgraph for each edge-subset – check if all spanning aborescence criteria are met, if one of the criteria does not apply, sort the tree out. Does anyone have an idea/approach to best find the spanning aborescences? Thank you very much! submitted by /u/Bright_Sprinkles_324 [link] [comments]
Dear all, I am currently working on a network science problem with directed graphs in python. I am using the networkx library. Now, I want to find all spanning aborescences (=spanning trees in a directed graph) for a given root node. Is there any built-in or partially built-function to do so? Right now, my approach is the following (unfortunately it finds too many trees, compared to the kirchhofftheorem) : -Start with a graph G(N, E) – Calculate all permutations of edges for N-1 edges, that include the root node – create a subgraph for each edge-subset – check if all spanning aborescence criteria are met, if one of the criteria does not apply, sort the tree out.
Does anyone have an idea/approach to best find the spanning aborescences?
Thank you very much!
submitted by /u/Bright_Sprinkles_324
[link] [comments]