Struct graph_solver::Graph

pub struct Graph {
    pub nodes: Vec<Node>,
    pub edges: Vec<Vec<Color>>,
    pub pairs: Vec<(usize, usize)>,
    pub no_triangles: bool,
    pub meet_quad: bool,
    pub connected: bool,
    pub commute_quad: Option<bool>,
    // some fields omitted
}

Stores information about graph.

An edge value 0 means no edge.

Fields

nodes: Vec<Node>

Nodes.

edges: Vec<Vec<Color>>

Edges.

pairs: Vec<(usize, usize)>

Pair constraints, using indices.

no_triangles: bool

Whether triangle cycles are allowed.

meet_quad: bool

Whether any shortest cycle for any vertex must be 4 or less.

connected: bool

Whether any node can be reached from any other node.

commute_quad: Option<bool>

Whether commutativity/anticommutativity is enabled for quads.

When a quad commutes, the edges along one dimension have same colors. When a quad anticommutes, the edges along one dimension have same colors, but with an odd number of positive and negative signs (1+3 or 3+1).

It is assumed that even and odd colors for edges above 2 anticommutes, e.g. 2 and 3 anticommutes.

• When set to Some(true), every quad commutes.
• When set to Some(false), every quad anticommutes.
• When set to None

Implementations

impl Graph

pub fn new() -> Graph

Creates a new graph.

Initialized with these default settings:

• no-triangles: false
• meet-quad: false
• connected: false

pub fn graphviz(
    &self,
    layout: &str,
    node_colors: &[&str],
    edge_colors: &[&str]
) -> String

Generates a GraphViz dot format.

pub fn fst_empty(&self) -> Option<(usize, usize)>

Finds the first empty edge.

pub fn min_colors(&self) -> Option<(usize, usize)>

Finds the edge with the least possible colors.

pub fn solve(self, solve_settings: SolveSettings) -> Option<Solution<Graph>>

Solves the graph puzzle using default strategy.

The default strategy is Graph::min_colors, Graph::colors.

pub fn push(&mut self, node: Node)

Adds a node description.

pub fn push_pair(&mut self, (i, j): (usize, usize))

Adds a pair constraint.

pub fn node_satisfied(&self, i: usize) -> Vec<Constraint>

Returns a list of edge constraints that makes a node unsatisfied.

If the returned list is empty, then the node is satisfied.

pub fn all_satisfied(&self) -> bool

Returns true if all nodes are satisfied.

pub fn pairs_satisfied(&self) -> bool

Returns true if all pair constraints are satisfied.

pub fn has_triangles(&self) -> bool

Returns whether the graph contains triangles.

pub fn meet_quad_satisfied(&self) -> bool

Returns true when for any node, the greatest shortest cycle is either 3 or 4.

pub fn commute_quad_satisfied(&self, commute: bool) -> bool

Returns true when for any quad, the commute property is satisfied.

For more information, see Graph::commute.

pub fn is_connected(&self) -> bool

Returns true if all nodes can be reached from any node.

pub fn is_upper_right_disconnected(&self) -> bool

Returns true if no-edges covers the upper right rectangle of the matrix form.

This means that the graph will be disconnected.

pub fn colors(&self, (i, j): (usize, usize)) -> Vec<Color>

Returns a list of possible actions for a node.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl Default for Graph

fn default() -> Graph

Returns the "default value" for a type.

impl Puzzle for Graph

type Pos = (usize, usize)

The type of position.

type Val = Color

The type of values stored in the puzzle.

fn set(&mut self, (i, j): (usize, usize), val: Color)

Sets a value at position.

fn get(&self, (i, j): (usize, usize)) -> Color

Gets value at position.

fn print(&self)

Print puzzle out to standard output.

fn solve_simple<F: FnMut(&mut Self, Self::Pos, Self::Val)>(&mut self, f: F)

Solve simple stuff faster. This will reduce the number of steps in solution. If you do not know how to solve this, leave it empty.

fn is_solved(&self) -> bool

Whether puzzle is solved.

fn remove(&mut self, other: &Graph)

Removes values from other puzzle to show changes.