Struct PetTemporalGraph 

pub struct PetTemporalGraph<N, L, V, T> { /* private fields */ }

A temporal graph backed by petgraph::StableGraph.

Nodes are identified by N, edges carry TemporalEdge<L, V, T>. A HashMap<N, NodeIndex> provides reverse lookup from user IDs to petgraph’s internal NodeIndex.

Implementations

impl<N, L, V, T> PetTemporalGraph<N, L, V, T>

where N: Eq + Hash + Clone + Debug, T: Clone,

pub fn new(initial_time: T) -> Self

Create a new empty graph with the given initial time.

pub fn set_time(&mut self, t: T)

Set the current time.

pub fn add_node(&mut self, id: N) -> NodeIndex

Add a node (or return existing index if already present).

pub fn add_edge(&mut self, from: N, label: L, value: V, interval: Interval<T>)

Add a temporal edge between two nodes.

pub fn add_edge_to_node( &mut self, from: N, label: L, to: N, interval: Interval<T>, )

where V: From<NodeRef<N>>,

Add a temporal edge with a node-valued target (also ensures target node exists).

pub fn add_edge_bounded( &mut self, from: N, label: L, value: V, start: T, end: T, )

where T: Ord,

Add a temporal edge with a bounded interval [start, end).

pub fn node_count(&self) -> usize

Number of nodes.

pub fn edge_count(&self) -> usize

Number of edges.

Trait Implementations

impl<N, L, T> DataSource for PetTemporalGraph<N, L, PetValue<N>, T>

where N: Eq + Hash + Clone + Debug + PartialOrd, L: Eq + Hash + Clone + Debug, T: Ord + Clone + Debug + Hash,

type N = N

Node identifier type.

type L = L

Edge label type.

type V = PetValue<N>

Value type (edge targets — can be nodes, strings, numbers, booleans).

type T = T

Time type.

fn edges_from( &self, node: &N, label: &L, at: &T, ) -> Vec<Edge<N, PetValue<N>, T>>

Follow edges from node with label, active at time at.

fn scan( &self, label: &L, constraint: &ValueConstraint<PetValue<N>>, at: &T, ) -> Vec<Edge<N, PetValue<N>, T>>

Find all source nodes that have an edge with label matching constraint, active at time at.

fn edges_from_any_time( &self, node: &N, label: &L, ) -> Vec<Edge<N, PetValue<N>, T>>

Find all edges from node with label that were ever valid (regardless of time). Used for temporal constraint checking.

fn scan_any_time( &self, label: &L, constraint: &ValueConstraint<PetValue<N>>, ) -> Vec<Edge<N, PetValue<N>, T>>

Scan for edges with label matching constraint at any time.

fn now(&self) -> T

The current time in the graph’s time model.

fn value_as_node(&self, value: &PetValue<N>) -> Option<N>

Check if a value represents a node reference (for traversal) vs. a literal (for comparison). This lets the pattern matcher know whether to follow a value as a node or compare it as data.