biconnected-components
| Crates.io | biconnected-components |
| lib.rs | biconnected-components |
| version | |
| source | src |
| created_at | 2023-07-20 09:25:35.04192+00 |
| updated_at | 2025-02-28 09:27:01.630445+00 |
| description | Find biconnected components in a graph |
| homepage | |
| repository | https://github.com/a-maier/biconnected-components |
| max_upload_size | |
| id | 921170 |
| Cargo.toml error: | TOML parse error at line 18, column 1 | 18 | autolib = false | ^^^^^^^ unknown field `autolib`, expected one of `name`, `version`, `edition`, `authors`, `description`, `readme`, `license`, `repository`, `homepage`, `documentation`, `build`, `resolver`, `links`, `default-run`, `default_dash_run`, `rust-version`, `rust_dash_version`, `rust_version`, `license-file`, `license_dash_file`, `license_file`, `licenseFile`, `license_capital_file`, `forced-target`, `forced_dash_target`, `autobins`, `autotests`, `autoexamples`, `autobenches`, `publish`, `metadata`, `keywords`, `categories`, `exclude`, `include` |
| size | 0 |
(a-maier)
documentation
README
biconnected-components
Compute the biconnected components of a graph.
Example
use petgraph::graph::UnGraph;
use biconnected_components::Bcc;
// construct a simple graph
let g = UnGraph::<(), ()>::from_edges([
(0, 1),
(1, 2)
]);
// Get a vector of the biconnected components defined by their node indices
let bcc = g.bcc();
assert_eq!(bcc.len(), 2);
for bcc_nodes in bcc {
println!("Found biconnected component with nodes {bcc_nodes:?}");
}
License: MIT OR Apache-2.0