Struct PlanarGraph 

pub struct PlanarGraph { /* private fields */ }

Planar graph — validated wrapper around SimpleGraph.

Construction validates the necessary planarity condition: |E| <= 3|V| - 6 for |V| >= 3. This is a necessary but not sufficient condition.

Example

use problemreductions::topology::{PlanarGraph, Graph};

// K4 is planar: 4 vertices, 6 edges, 6 <= 3*4 - 6 = 6
let edges = vec![(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)];
let g = PlanarGraph::new(4, edges);
assert_eq!(g.num_vertices(), 4);
assert_eq!(g.num_edges(), 6);

Implementations

impl PlanarGraph

pub fn new(num_vertices: usize, edges: Vec<(usize, usize)>) -> Self

Create a new planar graph.

Panics

Panics if the graph violates the necessary planarity condition |E| <= 3|V| - 6.

pub fn inner(&self) -> &SimpleGraph

Get a reference to the underlying SimpleGraph.

Trait Implementations

impl CastToParent for PlanarGraph

type Parent = SimpleGraph

The parent type.

fn cast_to_parent(&self) -> SimpleGraph

Convert this value to its parent type.

impl Clone for PlanarGraph

fn clone(&self) -> PlanarGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PlanarGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for PlanarGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Graph for PlanarGraph

const NAME: &'static str = "PlanarGraph"

The name of the graph type (e.g., “SimpleGraph”, “KingsSubgraph”).

fn num_vertices(&self) -> usize

Returns the number of vertices in the graph.

fn num_edges(&self) -> usize

Returns the number of edges in the graph.

fn edges(&self) -> Vec<(usize, usize)>

Returns all edges as a list of (u, v) pairs.

fn has_edge(&self, u: usize, v: usize) -> bool

Checks if an edge exists between vertices u and v.

fn neighbors(&self, v: usize) -> Vec<usize>

Returns all neighbors of vertex v.

fn degree(&self, v: usize) -> usize

Returns the degree of vertex v (number of neighbors).

fn is_empty(&self) -> bool

Returns true if the graph has no vertices.

fn for_each_edge<F>(&self, f: F)

where F: FnMut(usize, usize),

Iterates over all edges, calling a closure for each.

impl Serialize for PlanarGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl VariantParam for PlanarGraph

const CATEGORY: &'static str = "graph"

Category name (e.g., "graph", "weight", "k").

const VALUE: &'static str = "PlanarGraph"

Type name within the category (e.g., "SimpleGraph", "i32").

const PARENT_VALUE: Option<&'static str>

Parent type name in the subtype hierarchy, or None for root types.