Crate neighborhood_diversity

Crate for computing the neighborhood diversity of simple, undirected graphs.

Quick Start

use neighborhood_diversity::prelude::*;

let graph = Graph::random_graph(10, 0.1);
let neighborhood_partition = calc_neighborhood_partition(&graph);
let neighborhood_diversity = neighborhood_partition.len();

Re-exports

pub use graph::Graph;

Modules

graph

Undirected graph represented by an adjacency matrix.

prelude

Convenience re-export of common members.

Functions

calc_neighborhood_partition

Returns the optimal neighborhood partition of the provided graph.