Graph.this

Note that most of the parameters are passed by const reference and must exist for the duration of the Graph object. Notes on parameters: "options": - the GraphOptions used to build the Graph. In some cases these can be different than the options provided by the Layer. "vertices": - a vector of S2Points indexed by VertexId. "edges": - a vector of VertexId pairs (sorted in lexicographic order) indexed by EdgeId. "input_edge_id_set_ids": - a vector indexed by EdgeId that allows access to the set of InputEdgeIds that were mapped to the given edge, by looking up the returned value (an InputEdgeIdSetId) in "input_edge_id_set_lexicon". "input_edge_id_set_lexicon": - a class that maps an InputEdgeIdSetId to a set of InputEdgeIds. "label_set_ids": - a vector indexed by InputEdgeId that allows access to the set of labels that were attached to the given input edge, by looking up the returned value (a LabelSetId) in the "label_set_lexicon". "label_set_lexicon": - a class that maps a LabelSetId to a set of S2Builder::Labels. "is_full_polygon_predicate": - a predicate called to determine whether a graph consisting only of polygon degeneracies represents the empty polygon or the full polygon (see s2builder.h for details).

  1. this()
  2. this(GraphOptions options, S2Point[] vertices, Edge[] edges, InputEdgeIdSetId[] input_edge_id_set_ids, IdSetLexicon input_edge_id_set_lexicon, LabelSetId[] label_set_ids, IdSetLexicon label_set_lexicon, IsFullPolygonPredicate is_full_polygon_predicate)

Meta