Function exponential_augmented_zagreb 

pub fn exponential_augmented_zagreb(graph: &Graph) -> IgraphResult<f64>

Compute the exponential augmented Zagreb index.

EAZ(G) = Σ_{(u,v)∈E} exp(du·dv / (du+dv-2))

Edges where du + dv - 2 == 0 (i.e. both endpoints have degree 1, which requires a multi-edge or a single-edge graph with n=2) contribute exp(+∞) → skipped with a contribution of 0. Self-loops are skipped.

Examples

use rust_igraph::{Graph, exponential_augmented_zagreb};

// K_3: 3 edges, d=(2,2), each exp(4/2) = exp(2) → 3·exp(2)
let g = Graph::from_edges(&[(0,1),(1,2),(0,2)], false, Some(3)).unwrap();
let expected = 3.0 * 2.0_f64.exp();
assert!((exponential_augmented_zagreb(&g).unwrap() - expected).abs() < 1e-10);