Wolfram Function Repository
Instant-use add-on functions for the Wolfram Language
Function Repository Resource:
Enumerate possible foliations of a directed acyclic graph
ResourceFunction["GraphFoliations"][g] returns foliations of a graph g. |
"IncludePermutations" | False | whether to include all permutations of slices for disconnected vertices |
"BundleFoliations" | False | whether to bundle all newly added vertices into one foliation or try all combinations |
"Direction" | Bottom | the direction to start building foliations (Top or Bottom) |
MaxItems | ∞ | set the upper limit of returned foliations |
Enumerate foliations of a graph:
In[1]:= |
Out[1]= |
This will return foliations with all possible slice permutations:
In[2]:= |
Out[2]= |
Bundling of foliations will always try to combine vertices into one slice if possible:
In[3]:= |
Out[3]= |
Building foliations from bottom to top may result in different unbundled foliations:
In[4]:= |
Out[4]= |
In[5]:= |
Out[5]= |
Limit enumeration with an upper bound for returned results:
In[6]:= |
Out[6]= |
This work is licensed under a Creative Commons Attribution 4.0 International License