pnevyk/gryf

Issues

• Implement shortest paths algorithm from "Negative-Weight Single-Source Shortest Paths in Near-linear Time" paper

  #38 opened 2 years ago by pnevyk
  0

• Create property-based tests for shortest paths algorithms

  #12 opened 4 months ago by pnevyk
  2

• Rename `builder.with` to `builder.using`

  #71 opened 4 months ago by pnevyk
  0

• Rename `ShortestPaths` to `SingleSourceShortestPaths`

  #39 opened 5 months ago by pnevyk
  1

• Fix hygiene of procedural macros

  #18 opened 5 months ago by pnevyk
  1

• Provide default implementations for counts and bounds

  #7 opened 5 months ago by pnevyk
  1

• Override default implementations by more efficient ones where it makes sense

  #6 opened 3 years ago by pnevyk
  1

• Support id types that are not integers in `CompactIdMap`

  #75 opened 9 months ago by pnevyk
  0

• Study `graphene` crate for inspiration

  #70 opened a year ago by pnevyk
  0

• Implicit graph helper struct

  #32 opened 2 years ago by pnevyk
  1

• Subset adapter

  #67 opened 2 years ago by pnevyk
  0

• Graph operations

  #4 opened 2 years ago by pnevyk
  3

• Shortest paths on undirected graphs with negative weights

  #66 opened 2 years ago by pnevyk
  0

• Benchmark automatic algorithm selection

  #65 opened 2 years ago by pnevyk
  0

• Return an edge that is part of a negative cycle in Bellman-Ford

  #63 opened 2 years ago by pnevyk
  0

• Semantics of neighbors iterator for undirected self-loops

  #55 opened 2 years ago by pnevyk
  2

• Fix storages

  #49 opened 2 years ago by pnevyk
  2

• Stable storage does not check vertex presence in neighbors iterator

  #56 opened 2 years ago by pnevyk
  0

• Desired behavior of shortest paths algorithms when the goal is not reached

  #29 opened 2 years ago by pnevyk
  1

• Toposort cycle error should contain edge that "caused" it

  #27 opened 2 years ago by pnevyk
  1

• Kahn algorithm does not recover from encountering a cycle

  #28 opened 2 years ago by pnevyk
  0

• Tweak API for using a custom storage in graphs

  #40 opened 2 years ago by pnevyk
  0

• Try to simplify generics for storage on graph encapsulations

  #47 opened 2 years ago by pnevyk
  1

• Validate applicability of gryf on top reverse dependencies of petgraph

  #52 opened 2 years ago by pnevyk
  0

• Consider changing `add_edge(src, dst, e)` to `add_edge(e: impl IntoEdge)`

  #51 opened 2 years ago by pnevyk
  0

• Parallel algorithms

  #35 opened 2 years ago by pnevyk
  1

• Implement `Index` and `IndexMut` std traits for Graph and Path

  #15 opened 3 years ago by pnevyk
  1

• Create property-based tests for topological sort algorithms

  #11 opened 2 years ago by pnevyk
  1

• Reconsider multi edges iteration

  #48 opened 2 years ago by pnevyk
  1

• State reuse between multiple runs of the same algorithm

  #45 opened 2 years ago by pnevyk
  0

• Refactor internals of adjacency matrix representation

  #36 opened 2 years ago by pnevyk
  0

• Improve `visit` module

  #44 opened 2 years ago by pnevyk
  0

• Constant weights

  #31 opened 2 years ago by pnevyk
  0

• Use BFS for shortest paths if unit weight is used

  #22 opened 2 years ago by pnevyk
  2

• Fallible methods

  #34 opened 2 years ago by pnevyk
  1

• Fix adding duplicate edge to AdjMatrix

  #14 opened 2 years ago by pnevyk
  1

• Extend `Neighbors` trait with common aliases

  #37 opened 2 years ago by pnevyk
  0

• Study `networkx` Python package for inspiration

  #33 opened 2 years ago by pnevyk
  0

• Toposort algorithms should support skipping cycles

  #26 opened 2 years ago by pnevyk
  0

• Make the library compile on stable

  #23 opened 2 years ago by pnevyk
  1

• Split `traits.rs` into submodules

  #13 opened 2 years ago by pnevyk
  1

• Algorithm configuration builders

  #20 opened 2 years ago by pnevyk
  2

• Implicit graphs

  #3 opened 2 years ago by pnevyk
  6

• Index types

  #17 opened 2 years ago by pnevyk
  2

• Graph generalizations

  #2 opened 4 years ago by pnevyk
  1

• `GraphIterator` trait

  #16 opened 3 years ago by pnevyk
  0

• Ensuring assumptions

  #5 opened 3 years ago by pnevyk
  2

• Fix `complete_graph_edge_count` for zero vertices

  #10 opened 3 years ago by pnevyk
  0

• Check number of edges when testing if graph is a path

  #9 opened 3 years ago by pnevyk
  0

• Ensure minimal generic type constraints are used

  #8 opened 3 years ago by pnevyk
  0