libgraph
libgraph copied to clipboard
bitwalker
A graph data structure library for Elixir projects
My graph theory's a little rusty, so it might be easy to do using the provided API, but is there an easy way to get a list of all the...
My use case is to build a Graph from data coming from a DB. When there are changes to it, I want to persist it back to DB. For this...
The last release was almost three years ago. Is there any reason for not releasing all the latest additions?
The currently published version of [this package on Hex](https://hex.pm/packages/libgraph) is `0.13.3`. There have been 2 releases since then (`0.14.0` was released in 2019). Is there any reason these releases haven't...
Does it make sense to allow pathfinding in a lazy way? Where the nodes and the edges can be added whilst traversing. Or is this a silly idea?
When adding large number of vertices, some of my vertices weren't added to the graph. For example ``` vertices = 0..250000 |> Enum.map(& &1) Graph.add_vertices(Graph.new, vertices) #Graph ``` I fixed...
Hi! I found an example, where `get_shortest_path` didn't works, where it looks like it should: ```elixir g = Graph.new(type: :undirected) |> Graph.add_vertices([1, 2, 3]) |> Graph.add_edge(1, 3) |> Graph.add_edge(3, 2)...
Aside from pathfinding issues #37 and #11, several of the Graph functions delegate to Graph.Directed in a way that is inapproriate for undirected graphs: - is_acyclic? - components - strong_components...
Hi there, I am just getting started with libgraph but I have noticed that I seem to be getting wrong results for the a_star function. What I am doing basically:...
