routee-compass-core 0.19.0

The core routing algorithms and data structures of the RouteE-Compass energy-aware routing engine
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

use super::SearchInstance;
use crate::model::network::{Edge, EdgeId, EdgeListId, VertexId};
use allocative::Allocative;
use serde::{Deserialize, Serialize};

#[derive(Copy, Clone, Serialize, Deserialize, Default, Debug, PartialEq, Eq, Allocative)]
#[serde(rename = "snake_case")]
pub enum Direction {
    #[default]
    Forward,
    Reverse,
}

impl Direction {
    pub fn get_incident_edges<'a>(
        &'a self,
        vertex_id: &'a VertexId,
        si: &'a SearchInstance,
    ) -> Box<dyn Iterator<Item = &'a (EdgeListId, EdgeId)> + 'a> {
        match self {
            Direction::Forward => si.graph.out_edges_iter(vertex_id),
            Direction::Reverse => si.graph.in_edges_iter(vertex_id),
        }
    }

    pub fn tree_key_vertex_id(&self, edge: &Edge) -> VertexId {
        match self {
            Direction::Forward => edge.dst_vertex_id,
            Direction::Reverse => edge.src_vertex_id,
        }
    }

    pub fn terminal_vertex_id(&self, edge: &Edge) -> VertexId {
        match self {
            Direction::Forward => edge.src_vertex_id,
            Direction::Reverse => edge.dst_vertex_id,
        }
    }

    // pub fn perform_edge_traversal(
    //     &self,
    //     edge_id: EdgeId,
    //     last_edge_id: Option<EdgeId>,
    //     start_state: &[StateVariable],
    //     si: &SearchInstance,
    // ) -> Result<EdgeTraversal, SearchError> {
    //     match self {
    //         Direction::Forward => {
    //             EdgeTraversal::forward_traversal(edge_id, last_edge_id, start_state, si)
    //         }
    //         Direction::Reverse => {
    //             EdgeTraversal::reverse_traversal(edge_id, last_edge_id, start_state, si)
    //         }
    //     }
    // }
}