Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::planarity_detail::LR_Planarity_Checker< GT, SA > Member List

This is the complete list of members for Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >, including all inherited members.

add_oriented_edge(const size_t src, const size_t tgt)Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
Arc typedefAleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
build_combinatorial_embedding()Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
build_combinatorial_embedding_bruteforce()Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
build_combinatorial_embedding_linear_lr()Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
build_nonplanar_certificate()Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
build_underlying_simple_graph()Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
child_edges_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
classify_k33(const Array< size_t > &branches, const Array< Compressed_Path > &paths) constAleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
classify_k5(const Array< size_t > &branches, const Array< Compressed_Path > &paths) constAleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
compute_faces_from_rotation(const Array< Array< size_t > > &order, const size_t isolated_vertices, const size_t num_components, Array< Array< size_t > > &face_idx, size_t &global_faces, const bool enforce_euler=true) constAleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
conflicting(const Interval &i, const size_t edge_id) constAleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
count_components() constAleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
edges_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
factorial_bounded(const size_t n, const size_t cap)Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivatestatic
fails_component_euler_bound() constAleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
fill_certificate_paths(const Array< size_t > &branches, const Array< Compressed_Path > &paths)Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
fill_embedding_result(const Array< Array< size_t > > &order, const Array< Array< size_t > > &face_idx, const size_t global_faces, const bool is_lr_linear)Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
find_in_array(const Array< size_t > &a, const size_t value)Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivatestatic
find_simplified_edge_id(const size_t u, const size_t v) constAleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
g_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
generate_permutations(Array< size_t > &tail, const size_t pos, const size_t first, Array< Array< size_t > > &out) constAleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
height_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
incident_edges_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
lowest(const Conflict_Pair &p) constAleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
lowpt2_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
lowpt_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
lowpt_edge_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
LR_Planarity_Checker(const GT &g, SA sa, Planarity_Test_Options options=Planarity_Test_Options())Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inline
make_edge_witness(const size_t u, const size_t v) constAleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
nesting_depth_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
Node typedefAleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
node_to_idx_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
nodes_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
options_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
orient_dfs(const size_t v)Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
oriented_src_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
oriented_tgt_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
other_endpoint(const size_t edge_id, const size_t x) constAleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
parent_edge_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
planar_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
ref_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
result_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
roots_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
run()Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inline
run_lr_planarity_test()Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
sa_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
side_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
simple_edges_are_planar(const Array< Simple_Edge > &simple_edges) constAleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
simplified_edge_input_arcs_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
sort_size_t_array(Array< size_t > &a)Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivatestatic
stack_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
stack_bottom_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
test_dfs(const size_t v)Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >inlineprivate
undirected_edge_seen_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private
undirected_to_oriented_Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >private