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
57
58
59
60
61
62
63
64
65
use super::{GraphPath, GraphEdge, GraphEdgeRef};
use crate::geo::*;

impl GraphEdgeRef {
    ///
    /// Creates a reversed version of this edge ref
    ///
    pub fn reversed(mut self) -> GraphEdgeRef {
        self.reverse = !self.reverse;
        self
    }
}

///
/// A GraphEdgeRef can be created from a GraphEdge in order to release the borrow
///
impl<'a, Point: 'a+Coordinate, Label: 'a+Copy> From<GraphEdge<'a, Point, Label>> for GraphEdgeRef {
    fn from(edge: GraphEdge<'a, Point, Label>) -> GraphEdgeRef {
        edge.edge
    }
}

///
/// A GraphEdgeRef can be created from a GraphEdge in order to release the borrow
///
impl<'a, 'b, Point: 'a+Coordinate, Label: 'a+Copy> From<&'b GraphEdge<'a, Point, Label>> for GraphEdgeRef {
    fn from(edge: &'b GraphEdge<'a, Point, Label>) -> GraphEdgeRef {
        edge.edge
    }
}

impl<Point: Coordinate+Coordinate2D, Label> GraphPath<Point, Label> {
    ///
    /// Given an edge ref, returns the edge ref that follows it
    ///
    #[inline]
    pub fn following_edge_ref(&self, edge_ref: GraphEdgeRef) -> GraphEdgeRef {
        if edge_ref.reverse {
            // Need to search in reverse for the edge
            for connected_from in self.points[edge_ref.start_idx].connected_from.iter() {
                for (edge_idx, edge) in self.points[*connected_from].forward_edges.iter().enumerate() {
                    if edge.end_idx == edge_ref.start_idx {
                        return GraphEdgeRef {
                            start_idx:  *connected_from,
                            edge_idx:   edge_idx,
                            reverse:    true
                        }
                    }
                }
            }

            panic!("Reverse edge could not be found")
        } else {
            // Can just use the following edge
            let edge = &self.points[edge_ref.start_idx].forward_edges[edge_ref.edge_idx];

            GraphEdgeRef {
                start_idx:  edge.end_idx,
                edge_idx:   edge.following_edge_idx,
                reverse:    false
            }
        }
    }
}