Struct DirectlyFollowsGraph 

pub struct DirectlyFollowsGraph {
    pub activities: Vec<String>,
    pub edges: Vec<DFGEdge>,
    pub start_activities: HashMap<String, u64>,
    pub end_activities: HashMap<String, u64>,
    pub activity_counts: HashMap<String, u64>,
}

A directly-follows graph (DFG).

Fields

activities: Vec<String>

Activities (nodes).

edges: Vec<DFGEdge>

Edges (from_activity, to_activity, count).

start_activities: HashMap<String, u64>

Start activities with frequency.

end_activities: HashMap<String, u64>

End activities with frequency.

activity_counts: HashMap<String, u64>

Activity frequencies.

Implementations

impl DirectlyFollowsGraph

pub fn new() -> Self

Create a new DFG.

pub fn outgoing(&self, activity: &str) -> Vec<&DFGEdge>

Get outgoing edges from an activity.

pub fn incoming(&self, activity: &str) -> Vec<&DFGEdge>

Get incoming edges to an activity.

pub fn edge(&self, source: &str, target: &str) -> Option<&DFGEdge>

Get edge between two activities.

Trait Implementations

impl Clone for DirectlyFollowsGraph

fn clone(&self) -> DirectlyFollowsGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DirectlyFollowsGraph

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

Formats the value using the given formatter.

impl Default for DirectlyFollowsGraph

fn default() -> Self

Returns the “default value” for a type.