Comments (9)
Can you gist up the result of inspect Graph.edges/1
? I can reconstruct the graph from that. Looks like my test graphs missed an edge case, sorry about that!
from libgraph.
Unfortunately the inspect approach didn't work so well. However, encoding it as JSON worked great!
https://gist.github.com/yonkeltron/e48c10985cfc1933b94e45b7dccfe655
from libgraph.
Yeah I forgot to mention that you can do inspect graph, structs: false
to dump the raw graph (or any struct for that matter!). I'm flying today, but I'll take a look as soon as I can!
from libgraph.
Found the problem - I forgot to account for self-referential edges. I've pushed the fix to master - looks good on my end though!
from libgraph.
from libgraph.
Yeah, specifically loops from a vertex back to itself.
from libgraph.
Will this fix go out in a dot release?
from libgraph.
Yep, I'll get one published today. I wanted to get some improvements into the initial clique detection code to try and optimize it (it's pretty slow on large graphs, which is expected, but I think there may be ways to do better than the current perf profile), but I can release what is there now and do another point release with those improvements.
from libgraph.
Just pushed 0.11.0 :)
from libgraph.
Related Issues (20)
- Might be better for Graph.topsort/1 to return :error and {:ok, sorted_graph}? HOT 1
- Hangs on iex -S mix with version 0.13.3 HOT 1
- Graph.edges/3 return empty list for undirected graph
- add_vertices/2 with labels?
- Question: Core in Erlang HOT 1
- Suspected memory leak HOT 1
- get_shortest_path doesn't work correctly on undirected graphs HOT 3
- Functions delegate to Graph.Directed for undirected graph HOT 1
- Duplicate vertex ids when adding high number of vertices HOT 12
- Lazy traversal HOT 5
- Publish to Hex HOT 1
- Subgraph is missing labels
- New release? HOT 1
- Save metadata for vertices and edges HOT 3
- finding cycles in directed graph HOT 2
- Duplicated edges from Graph.edges(g, v) when v has a self-reference? HOT 5
- Incorrect Return Value of Preorder/Postorder
- add support for leaf_vertices function?
- Unexpectedly endless pathfinding from the nth size. HOT 2
- Infinite loop when nil passed in as graph HOT 2
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 libgraph.