Comments (2)
Thank you very much for pointing this out, I updated this error message earlier today and will publish the updated NuGet package later today.
In case you want to use Louvain on the presented graph, I have 2 details to point out to you:
- For the usage of the Louvain method the FGL.ArrayAdjacencyGraph module is needed, so you would have to use that instead of the standard FGL Graph model. Additionally, while you can use the ArrayAdjacencyGraph Model to get directed Graph info, it is generally an undirected graph model optimized for the Louvain algorithm.
- The Louvain method is optimized for undirected Graphs since the definition of modularity for directed graphs is debatable. You can treat a directed graph as undirected to perform Louvain, but the original Louvain Algorithm is specific for undirected graphs.
There exist some suggestions on how to treat modularity and therefore Louvain in directed graphs and I am working on upgrading the FGL library to include such a directed Modularity approach in the future, but as of now a specific implementation of a directed Louvain approach for community detection is not implemented in Fsharp.FGL.
from fsharp.fgl.
This is actually caused by trying to create duplicate edges. Id suggest updating the error message to say this.
from fsharp.fgl.
Related Issues (20)
- [Bug] Undirected.Graph.toAdjacencyMatrix only shows an edge one time instead HOT 3
- GDF files saved by gephi cannot be opend due to formating issues.
- Switch to new buildchain HOT 1
- Vertices module moved into the Graph module HOT 2
- [Docs] Error in example for documentation for Creating a Graph HOT 1
- [Feature Request] Consistent Namespace Naming
- [Feature Request] Modules eigenvector determination
- [Feature Request] Functions to calculate modularity on all available graph models
- [BUG] Directed graph: decompose only removes outgoing edges HOT 2
- [Feature Request] ArrayAdjacencyGraph Namespace names
- [BUG] Edges.fold processes edges twice in directed Graph HOT 5
- Centrality measures and shortest path HOT 5
- [Docs] `List.init` mistake in AdjacencyGraph tutorial
- [Feature Request] Call undirected edges in FGL.ArrayAdjacencyGraph HOT 1
- [Feature Request] Combine FGL and FGL.ArrayAdjacencyGraph into one Project
- [Feature Request]Add functions to convert FGL Graph into ArrayAdjacencyGraph
- [Feature Request]Add tests for undirected edge calls in FGL.ArrayAdjacencyGraph
- [Feature Request] Function to call complete Vertex List in ArrayAdjacencyGraph
- [Renaming required]
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from fsharp.fgl.