coordinates_generator
|
This is the complete list of members for graph, including all inherited members.
add_edge(shared_ptr< Vertex > a, shared_ptr< Vertex > b, shared_ptr< Face > face, int a_index, int b_index, pair< double, double > previous_vertex, pair< double, double > next_vertex, bool outer_face_bool=false) | graph | inline |
add_vertex(Edge *edge) | graph | inline |
blocked | graph | |
close_files() | graph | inline |
coordinates_of_special_vertices | graph | |
counter | graph | |
create_all_possible_drawings() | graph | inline |
create_all_special_vertices() | graph | inline |
create_base_star() | graph | inline |
create_special_vertex(int index, int x, int y) | graph | inline |
delete_edge_back(bool outer_face_bool=false) | graph | inline |
delete_vertex(Vertex *a) | graph | inline |
done | graph | |
edges | graph | |
find_path_through_triangulation(shared_ptr< Vertex > a, shared_ptr< Vertex > b, shared_ptr< Face > face, int a_index, int b_index, pair< double, double > shift_previous, pair< double, double > shift_next, bool outer_face_bool=false) | graph | inline |
find_shortest_path(const vector< vector< double > > &distances, vector< shared_ptr< Vertex > > &face_vertices) | graph | inline |
find_the_way_to_intersect(int s_index, int t_index, int a, int b) | graph | inline |
graph(int n, int ii) | graph | inline |
index | graph | |
most_away | graph | |
number_of_vertices | graph | |
outer_face | graph | |
outer_vertices | graph | |
output_file | graph | |
realized | graph | |
recolor_fingerprint(const string &rotation) | graph | inline |
segments | graph | |
starts | graph | |
tearup_lines_in_half(Edge *edge, vector< shared_ptr< Vertex > > &a_half, vector< shared_ptr< Vertex > > &b_half) | graph | inline |
update_most_away(vector< pair< double, double > > vertices) | graph | inline |
vertices_ | graph | |
write_coordinates() | graph | inline |