Merged to bgpkit/valley-free
This crate analyses the AS relationship as a petgraph graph, generating a path DAG based on a valley-free model.
The normal topology has no acyclic guarantees
But after transforming it into a path graph you will have a DAG from the source AS to all others AS.
And then you can use this DAG with all the classic graph methods to analyze it. For example, you can find the length of all shortest paths, or even all the paths.
This library is not on crates.io yet, so you need to install it from GitHub.
valley-free-graph = { git = "https://github.com/guissalustiano/valley-free-graph.git" }
To use the examples expect the CAIDA-as 2023-12-01 dataset on the root directory.
The examples are available in the examples/ direction.
You can run it with cargo run --example=<filename without .rs>.
This library is highly inspired by valley-free from bgpkit, but try to return a subset of all paths instead, return the whole graph, and do what you want with that using all the power of graph libraries.