Struct DirectedGraph 

pub struct DirectedGraph<T> { /* private fields */ }

A simple directed graph structure for using in the SDDP algorithm, to make the temporal decomposition of the problem, store the power system configurations, the built policies and simulation results.

Implementations

impl<T> DirectedGraph<T>

pub fn new() -> Self

pub fn add_node(&mut self, data: T) -> Result<usize, GraphBuildingError>

Adds a new node to the node collection. Since the graph is only built at the beginning of the algorithm, the push call is not expensive for the total time

pub fn add_edge( &mut self, source_id: usize, target_id: usize, ) -> Result<(), GraphBuildingError>

Adds a new edge to the adjancency maps. Since the graph is only built at the beginning of the algorithm, the push call is not expensive for the total time

pub fn get_node(&self, id: usize) -> Option<&Node<T>>

pub fn get_node_id_with<F>(&self, f: F) -> Option<usize>

where F: Fn(&T) -> bool,

pub fn get_all_node_ids_with<F>(&self, f: F) -> Vec<usize>

where F: Fn(&T) -> bool,

pub fn get_node_mut(&mut self, id: usize) -> Option<&mut Node<T>>

pub fn get_children(&self, id: usize) -> Option<&[usize]>

pub fn get_parents(&self, id: usize) -> Option<&[usize]>

pub fn get_bfs(&self, root_id: usize, reverse: bool) -> Vec<usize>

pub fn node_count(&self) -> usize

pub fn is_root(&self, id: usize) -> bool

pub fn is_leaf(&self, id: usize) -> bool

impl<T> DirectedGraph<T>

pub fn map_topology_with_default<U: Default>(&self) -> DirectedGraph<U>

pub fn map_topology_with<U, F>(&self, f: F) -> DirectedGraph<U>

where F: FnMut(&T, usize) -> U,