Struct graph_types::CompleteGraph

pub struct CompleteGraph { /* private fields */ }

CompleteGraph represents a graph where every node is connected to every other node.

Examples

use graph_theory::{CompleteGraph, GraphEngine};
let graph = CompleteGraph::new(3);
assert_eq!(graph.count_nodes(), 3);
assert_eq!(graph.count_edges(), 3 * 2);

Implementations

impl CompleteGraph

pub fn new(rank: usize) -> Self

Creates a new complete graph with the given rank.

Examples

use graph_theory::CompleteGraph;
let graph = CompleteGraph::new(3);

pub fn directed(rank: usize) -> Self

Creates a new directed complete graph with the given rank.

Examples

use graph_theory::CompleteGraph;
let graph = CompleteGraph::directed(3);

pub fn check<G: GraphEngine>(graph: &G) -> Option<Self>

Check if the given graph is a complete graph, and if so, return it.

Trait Implementations

impl Clone for CompleteGraph

fn clone(&self) -> CompleteGraph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for CompleteGraph

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

Formats the value using the given formatter.

impl Display for CompleteGraph

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

Formats the value using the given formatter.

impl GraphEngine for CompleteGraph

fn count_nodes(&self) -> usize

Count the number of nodes in the graph.

fn remove_node_with_edges(&mut self, _: usize)

Remove the given node and all edges connected to it.

fn insert_edge_with_nodes<E: Edge>(&mut self, _edge: E) -> EdgeInsertID

Insert edge to graph, if the nodes does not exist, also insert them.

fn remove_edge<E>(&mut self, _: E)where E: Into<EdgeRemoveAction>,

Remove edge by given edge-id or start and end node-id.

fn count_edges(&self) -> usize

Count the number of edges in the graph.

fn exception(&self, ability: &'static str) -> !

Mark the graph engine does not support the ability.

fn get_nodes(&self) -> GetNodesVisitor<'_, Self>

Arguments

fn insert_node(&mut self, node_id: usize) -> usize

Insert a node without any neighbors (edges).

fn remove_node(&mut self, node_id: usize)

Remove the given node.

fn get_edges(&self) -> GetEdgesVisitor<'_, Self>

fn mut_edges(&mut self) -> MutEdgesVisitor<'_, Self>

Arguments

fn insert_edge<E: Edge>(&mut self, edge: E) -> EdgeInsertID

Insert a edge between two nodes.

impl PartialEq<CompleteGraph> for CompleteGraph

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

This method tests for self and other values to be equal, and is used by ==.

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

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

impl Copy for CompleteGraph

impl Eq for CompleteGraph

impl StructuralEq for CompleteGraph

impl StructuralPartialEq for CompleteGraph