Framework using this library
Install with Conda
Create an environment containing GraphDegree 0.1.0, its Blyx source and a runnable example. Run the second command with Blyx 0.2.1, Rust and a host linker installed.
conda create -y --prefix ./blyx-env --override-channels -c https://rahulchaube1.github.io/blyx-packages blyx-graphdegree=0.1.0=0 blyxc native-run ./blyx-env/share/blyx/graphdegree/main.blyx
To use this package in your application, copy share/blyx/graphdegree/vendor/graphdegree from the environment into your project's vendor directory.
Import into a Blyx project
Install Blyx 0.2.1, Rust 1.85 or newer and a host linker. From the directory containing your entry file, clone this tagged release.
git clone --depth 1 --branch v0.1.0 https://github.com/Rahulchaube1/blyx-graphdegree.git vendor/graphdegree
You can also download GraphDegree as a ZIP. Extract its contents into vendor/graphdegree.
Save this as main.blyx beside vendor and run blyxc native-run main.blyx.
use vendor::graphdegree::graphdegree;
fn main() {
let starts = [1, 2, 1];
let ends = [2, 1, 1];
let node = 1.0;
let result = graphdegree_at_node(starts, ends, node);
if len(result) == 0 { println!("invalid"); return; }
let mut i = 0;
while i < len(result) {
println!(at(result, i));
i += 1;
}
}Expected output
2 2 1
API and input requirements
Returns [incoming, outgoing, incident self-loops] for a directed multigraph. Each loop adds one to each direction. Invalid arguments and nonfinite results return an empty vector.
| API | Use |
|---|---|
graphdegree_at_node(starts, ends, node) | Returns [incoming, outgoing, incident self-loops] for a directed multigraph. Each loop adds one to each direction. |
Develop and contribute
Open the tagged source to read the implementation and examples. Include the smallest reproducible Blyx program, compiler version and expected result when reporting an issue.
