Module graph_algo_ptas::generation::planar

Contains an algorithm to generate planar graphs derived from A simple linear time algorithm for embedding maximal planar graphs

use graph_algo_ptas::generation::planar::generate;

// Generates a random graph with 10 nodes.
let rg = generate(10, None).to_pet_graph();
assert_eq!(rg.node_count(), 10);
assert_eq!(rg.edge_count(), 3 * 10 - 6);
// Generates a graph with 100 nodes the same graph is generated for every call with the same seed.
let dg = generate(100, Some(44)).to_pet_graph();
assert_eq!(dg.node_count(), 100);
assert_eq!(dg.edge_count(), 3 * 100 - 6);

Functions

generate

Returns a randomly generated Graph with degree n. If seed is not None the rng is seeded with the value of seed.