简易图

泛型图的简易Rust实现

描述

表示泛型 顶点 和无向 连接 的数据结构

示例

let verts = vec![0, 1, 2, 3, 4, 10];
let conns = vec![(0, 1), (1, 2), (2, 3), (3, 4), (10, 0), (4, 10)];

let graph = Graph::from_data(verts.into_iter(), conns.into_iter());
assert_eq!(verts.len(), graph.len());

let new_vertex = 15;
assert!(graph.add_vertex(new_vertex));
assert!(graph.contains(&new_vertex));

graph.add_edge(&1, &4);
assert!(graph.is_connected(&1, &4));
assert!(graph.is_connected(&4, &1));