/// Returns the vertex id of the two adjacent vertices to the given edge
/// and ordered such that `ordered_edge_vertices.0 < ordered_edge_vertices.1`.
Returns the vertex id of the two adjacent vertices to the given edge
and ordered such that `ordered_edge_vertices.0 < ordered_edge_vertices.1`.
Returns the vertex id of the two adjacent vertices to the given edge and ordered such that ` ordered_edge_vertices . 0 < ordered_edge_vertices . 1 ` .
pub fn ordered_edge_vertices(&self, halfedge_id: HalfEdgeID) -> (VertexID, VertexID)
    {
        let mut walker = self.walker_from_halfedge(halfedge_id);
        let v1 = walker.vertex_id().unwrap();
        let v2 = walker.as_twin().vertex_id().unwrap();
        if v1 < v2 { (v1, v2) } else { (v2, v1) }
    }
pub fn ordered_edge_vertices ( & self , halfedge_id : HalfEdgeID ) -> ( VertexID , VertexID ) { let mut walker = self . walker_from_halfedge ( halfedge_id ) ; let v1 = walker . vertex_id ( ) . unwrap ( ) ; let v2 = walker . as_twin ( ) . vertex_id ( ) . unwrap ( ) ; if v1 < v2 { ( v1 , v2 ) } else { ( v2 , v1 ) } }
Returns the vertex id of the two adjacent vertices to the given edge
and ordered such that `ordered_edge_vertices.0 < ordered_edge_vertices.1`.
Returns the vertex id of the two adjacent vertices to the given edge and ordered such that ` ordered_edge_vertices . 0 < ordered_edge_vertices . 1 ` .
&self
halfedge_id
HalfEdgeID