Struct graph_canon::dense::DenseGraph

pub struct DenseGraph {
    pub g: Vec<u64>,
    pub n: usize,
    pub e: usize,
    pub m: usize,
    pub nodes: Nodes,
}

Fields

g: Vec<u64>

n: usize

e: usize

m: usize

nodes: Nodes

Implementations

impl DenseGraph

pub fn from_petgraph<N, E, Ty>(graph: &Graph<N, E, Ty>) -> Selfwhere Ty: EdgeType,

pub fn orbits(&self) -> &[i32]

Trait Implementations

impl Debug for DenseGraph

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

Formats the value using the given formatter.

impl Hash for DenseGraph

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq<DenseGraph> for DenseGraph

fn eq(&self, other: &DenseGraph) -> 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 Eq for DenseGraph

impl StructuralEq for DenseGraph

impl StructuralPartialEq for DenseGraph