Struct KingsSubgraph 

pub struct KingsSubgraph { /* private fields */ }

A King’s Subgraph — an unweighted unit disk graph on a square lattice.

Vertices occupy integer grid positions with edges determined by distance (king’s move connectivity: adjacent horizontally, vertically, or diagonally). This is a subtype of UnitDiskGraph in the variant hierarchy.

Edges are computed on-the-fly: two positions are connected if their Euclidean distance is strictly less than 1.5.

Implementations

impl KingsSubgraph

pub fn new(positions: Vec<(i32, i32)>) -> Self

Create a KingsSubgraph from a list of integer positions.

pub fn positions(&self) -> &[(i32, i32)]

Get the positions of all vertices.

pub fn num_positions(&self) -> usize

Get the number of positions (vertices).

Trait Implementations

impl CastToParent for KingsSubgraph

type Parent = UnitDiskGraph

The parent type.

fn cast_to_parent(&self) -> UnitDiskGraph

Convert this value to its parent type.

impl Clone for KingsSubgraph

fn clone(&self) -> KingsSubgraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for KingsSubgraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for KingsSubgraph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Graph for KingsSubgraph

const NAME: &'static str = "KingsSubgraph"

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 PartialEq for KingsSubgraph

fn eq(&self, other: &KingsSubgraph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for KingsSubgraph

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 KingsSubgraph

const CATEGORY: &'static str = "graph"

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

const VALUE: &'static str = "KingsSubgraph"

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.

impl StructuralPartialEq for KingsSubgraph