Our great sponsors
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
That sounds as an interesting use case. The library is written such that it should be possible to implement a few traits on your custom type and then you can use this type in the algorithms. So instead of storing something explicitly in a graph, you could for example retrieve nodes connected to a node by making a request. I am not sure if that's a good idea, but these are scenarios that I am keeping in my mind. If you are interested in this, you may check this and this example, or ask me any question.
There is a comparison of different Rust graph libraries in terms of user experience and provided API, since that has been my main focus in gryf so far.
Related posts
- TheAlgorithms/Rust: All Algorithms Implemented in Rust
- Dynamic programming solutions in Rust?
- Who ranks better? Memgraph vs. NetworkX PageRank
- We are happy to announce graph v0.3.0 - The crate ships with parallel graph algorithms and APIs to implement your own algorithms - Now on stable and with Python bindings.
- Data structures/algorithms course in rust?