Struct Graph 

pub struct Graph {
    pub name: String,
    pub graph_type: GraphType,
    pub nodes: HashMap<NodeId, GraphNode>,
    pub edges: HashMap<EdgeId, GraphEdge>,
    pub adjacency: HashMap<NodeId, Vec<EdgeId>>,
    pub reverse_adjacency: HashMap<NodeId, Vec<EdgeId>>,
    pub nodes_by_type: HashMap<NodeType, Vec<NodeId>>,
    pub edges_by_type: HashMap<EdgeType, Vec<EdgeId>>,
    pub metadata: GraphMetadata,
    /* private fields */
}

A graph containing nodes and edges.

Fields

name: String

Graph name.

graph_type: GraphType

Graph type.

nodes: HashMap<NodeId, GraphNode>

Nodes indexed by ID.

edges: HashMap<EdgeId, GraphEdge>

Edges indexed by ID.

adjacency: HashMap<NodeId, Vec<EdgeId>>

Adjacency list (node -> outgoing edges).

reverse_adjacency: HashMap<NodeId, Vec<EdgeId>>

Reverse adjacency (node -> incoming edges).

nodes_by_type: HashMap<NodeType, Vec<NodeId>>

Node type index.

edges_by_type: HashMap<EdgeType, Vec<EdgeId>>

Edge type index.

metadata: GraphMetadata

Metadata.

Implementations

impl Graph

pub fn new(name: &str, graph_type: GraphType) -> Self

Creates a new graph.

pub fn add_node(&mut self, node: GraphNode) -> NodeId

Adds a node to the graph, returning its ID.

pub fn add_edge(&mut self, edge: GraphEdge) -> EdgeId

Adds an edge to the graph, returning its ID.

pub fn get_node(&self, id: NodeId) -> Option<&GraphNode>

Gets a node by ID.

pub fn get_node_mut(&mut self, id: NodeId) -> Option<&mut GraphNode>

Gets a mutable node by ID.

pub fn get_edge(&self, id: EdgeId) -> Option<&GraphEdge>

Gets an edge by ID.

pub fn get_edge_mut(&mut self, id: EdgeId) -> Option<&mut GraphEdge>

Gets a mutable edge by ID.

pub fn nodes_of_type(&self, node_type: &NodeType) -> Vec<&GraphNode>

Returns all nodes of a given type.

pub fn edges_of_type(&self, edge_type: &EdgeType) -> Vec<&GraphEdge>

Returns all edges of a given type.

pub fn outgoing_edges(&self, node_id: NodeId) -> Vec<&GraphEdge>

Returns outgoing edges from a node.

pub fn incoming_edges(&self, node_id: NodeId) -> Vec<&GraphEdge>

Returns incoming edges to a node.

pub fn neighbors(&self, node_id: NodeId) -> Vec<NodeId>

Returns neighbors of a node.

pub fn node_count(&self) -> usize

Returns the number of nodes.

pub fn edge_count(&self) -> usize

Returns the number of edges.

pub fn out_degree(&self, node_id: NodeId) -> usize

Returns the out-degree of a node.

pub fn in_degree(&self, node_id: NodeId) -> usize

Returns the in-degree of a node.

pub fn degree(&self, node_id: NodeId) -> usize

Returns the total degree of a node.

pub fn anomalous_nodes(&self) -> Vec<&GraphNode>

Returns anomalous nodes.

pub fn anomalous_edges(&self) -> Vec<&GraphEdge>

Returns anomalous edges.

pub fn compute_statistics(&mut self)

Computes graph statistics.

pub fn edge_index(&self) -> (Vec<NodeId>, Vec<NodeId>)

Returns the edge index as a pair of vectors (source_ids, target_ids).

pub fn node_features(&self) -> Vec<Vec<f64>>

Returns the node feature matrix (nodes x features).

pub fn edge_features(&self) -> Vec<Vec<f64>>

Returns the edge feature matrix (edges x features).

pub fn node_labels(&self) -> Vec<Vec<String>>

Returns node labels.

pub fn edge_labels(&self) -> Vec<Vec<String>>

Returns edge labels.

pub fn node_anomaly_mask(&self) -> Vec<bool>

Returns node anomaly flags.

pub fn edge_anomaly_mask(&self) -> Vec<bool>

Returns edge anomaly flags.

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<'de> Deserialize<'de> for Graph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for Graph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.