FSharp.FGL
FSharp.FGL copied to clipboard
CSBiology
Functional graph library for F#
**Is your feature request related to a problem? Please describe.** Modularity is a very important measure of the graph structure. The Louvain method for community detection operates on modularity optimization,...
After network modules are identified the 'average signal profile' can be identified by calculating the modules eigengene. It would be a handy addition to investigate the structure of module. >...
**Is your feature request related to a problem? Please describe.** In recent libary changes (#31), the folder structure and namespaces where adjusted quite a bit. ATM it does not seem...
### Repro steps open FSharp.FGL.Undirected let rnd = System.Random() let myGraph = FSharp.FGL.Directed.Models.gilbert (fun i -> i,i) 4 0.3 |> FSharp.FGL.Directed.Edges.undirect (fun _ _ -> 1) myGraph |> Edges.map (fun...
### Background I'm currently looking into possible implementations for the DFS. I'm basing my research on the FGL paper, the original FGL DFS implementation (https://github.com/haskell/fgl/blob/master/Data/Graph/Inductive/Query/DFS.hs) as well as this blog...
At the moment in order to call an edge you need to call the edge with a designated source and target (As explained in #50 ). Adding functionality to call...
Add tests for the new functions calling undirected edges in ArrayAdjacencyGraph
Combine FGL and FGL.ArrayAdjacencyGraph into one Project to streamline development
Hi, I am looking for the centrality measures 'Betweeness' and 'Closeness' Both build on Shortest Path calculation which also doesn't seem available yet. Are their plans to implement this? My...
