issues
search
pnevyk
/
gryf
Graph data structure library aspiring to be convenient, versatile, correct and performant.
MIT License
69
stars
1
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
Support id types that are not integers in `CompactIdMap`
#75
pnevyk
opened
3 months ago
0
Refactor Id type
#74
pnevyk
closed
3 months ago
0
Fix warnings
#73
pnevyk
closed
3 months ago
0
Rename `builder.with` to `builder.using`
#71
pnevyk
opened
3 months ago
0
Study `graphene` crate for inspiration
#70
pnevyk
opened
8 months ago
0
Create module for adapters
#69
pnevyk
closed
1 year ago
0
Handle undirected graphs with unsigned weights appropriately
#68
pnevyk
closed
1 year ago
0
Subset adapter
#67
pnevyk
closed
1 year ago
0
Shortest paths on undirected graphs with negative weights
#66
pnevyk
closed
1 year ago
0
Benchmark automatic algorithm selection
#65
pnevyk
opened
1 year ago
0
Fix adding with overflow in Bellman-Ford
#64
pnevyk
closed
1 year ago
0
Return an edge that is part of a negative cycle in Bellman-Ford
#63
pnevyk
opened
1 year ago
0
Implement indexing for graph encapsulations
#62
pnevyk
closed
1 year ago
0
Fix stable storage
#61
pnevyk
closed
1 year ago
0
Return error if goal was not reached in shortest paths algorithm
#60
pnevyk
closed
1 year ago
0
Toposort improvements
#59
pnevyk
closed
1 year ago
0
Add algoritm for checking connectedness of a graph/vertices
#58
pnevyk
closed
1 year ago
0
Add API for adding edges between vertices, inserted if not in graph
#57
pnevyk
closed
1 year ago
0
Stable storage does not check vertex presence in neighbors iterator
#56
pnevyk
closed
1 year ago
0
Semantics of neighbors iterator for undirected self-loops
#55
pnevyk
closed
1 year ago
2
Storages fixes
#54
pnevyk
closed
1 year ago
0
Custom storage UX improvements
#53
pnevyk
closed
1 year ago
0
Validate applicability of gryf on top reverse dependencies of petgraph
#52
pnevyk
opened
1 year ago
0
Consider changing `add_edge(src, dst, e)` to `add_edge(e: impl IntoEdge)`
#51
pnevyk
opened
1 year ago
0
Improve repository-level documentation
#50
pnevyk
closed
1 year ago
0
Fix storages
#49
pnevyk
closed
1 year ago
2
Reconsider multi edges iteration
#48
pnevyk
closed
1 year ago
1
Try to simplify generics for storage on graph encapsulations
#47
pnevyk
closed
1 year ago
1
Beginning the correctness journey
#46
pnevyk
closed
1 year ago
1
State reuse between multiple runs of the same algorithm
#45
pnevyk
opened
1 year ago
0
Improve `visit` module
#44
pnevyk
opened
1 year ago
0
BFS algorithm for shortest path
#43
pnevyk
closed
1 year ago
0
Adjacency matrix refactor
#42
pnevyk
closed
1 year ago
0
Fallible operations
#41
pnevyk
closed
1 year ago
0
Tweak API for using a custom storage in graphs
#40
pnevyk
closed
1 year ago
0
Rename `ShortestPaths` to `SingleSourceShortestPaths`
#39
pnevyk
opened
1 year ago
0
Implement shortest paths algorithm from "Negative-Weight Single-Source Shortest Paths in Near-linear Time" paper
#38
pnevyk
opened
1 year ago
0
Extend `Neighbors` trait with common aliases
#37
pnevyk
opened
1 year ago
0
Refactor internals of adjacency matrix representation
#36
pnevyk
closed
1 year ago
0
Parallel algorithms
#35
pnevyk
opened
1 year ago
1
Fallible methods
#34
pnevyk
closed
1 year ago
1
Study `networkx` Python package for inspiration
#33
pnevyk
opened
1 year ago
0
Implicit graph helper struct
#32
pnevyk
opened
1 year ago
1
Constant weights
#31
pnevyk
closed
1 year ago
0
UX improvements
#30
pnevyk
closed
1 year ago
0
Desired behavior of shortest paths algorithms when the goal is not reached
#29
pnevyk
closed
1 year ago
1
Kahn algorithm does not recover from encountering a cycle
#28
pnevyk
closed
1 year ago
0
Toposort cycle error should contain edge that "caused" it
#27
pnevyk
closed
1 year ago
1
Toposort algorithms should support skipping cycles
#26
pnevyk
opened
1 year ago
0
Support stable rust
#25
pnevyk
closed
1 year ago
0
Next