Struct Graph 

pub struct Graph {
    pub n_nodes: usize,
    pub edges: Vec<(usize, usize, String)>,
    pub node_labels: Vec<String>,
}

Simple graph representation for kernel computation

Fields

n_nodes: usize

Number of nodes

edges: Vec<(usize, usize, String)>

Edge list (from, to, edge_type)

node_labels: Vec<String>

Node labels

Implementations

impl Graph

pub fn new(n_nodes: usize) -> Self

Create a new graph

pub fn add_edge(&mut self, from: usize, to: usize, edge_type: String)

Add an edge to the graph

pub fn set_node_label(&mut self, node: usize, label: String)

Set node label

pub fn adjacency_list(&self) -> Vec<Vec<usize>>

Get adjacency list representation

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

Get neighbors of a node

pub fn from_tlexpr(expr: &TLExpr) -> Self

Convert TLExpr to graph representation

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate 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 PartialEq for Graph

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

impl StructuralPartialEq for Graph