Function graph_algo_ptas::data_structure::ring_segment::ring_segment

source · [−]

pub fn ring_segment<V: Vertex + Eq + Hash + Clone + Debug, D: Dart + Eq + Hash + Clone + Debug, F: Face + Eq + Hash + Clone + Debug, VI: Iterator<Item = V>, DI: Iterator<Item = D>, FI: Iterator<Item = F>, G: GraphDCEL<V, D, F, VI, DI, FI> + Default>(
    input_graph: &G,
    start_vertex: V,
    rings: Vec<HashSet<V>>,
    i: usize
) -> (G, Option<V>, Option<V>)

Expand description

Returns a tuple which contains new graph containing the nodes of ring i and the nodes less then i combined in a single node and the combined node.