Higra
latest

Informations

  • Changelog
    • 0.6.10
    • 0.6.8
    • 0.6.7
    • 0.6.6
    • 0.6.5
    • 0.6.4
    • 0.6.2
    • 0.6.1
      • Breaking changes
      • Other changes
    • 0.6.0
      • Breaking changes
      • Other changes
    • 0.5.3
    • 0.5.2
    • 0.5.1
    • 0.5.0
      • Breaking change
      • Other changes
    • 0.4.5
    • 0.4.4
    • 0.4.2
      • Breaking change
      • Other changes
    • 0.4.1
    • 0.4.0
      • Breaking change
      • Other changes
    • 0.3.8
    • 0.3.7
    • 0.3.6
    • 0.3.5
      • Breaking change
      • Other changes
    • 0.3.4
    • 0.3.3
    • 0.3.2
    • 0.3.1
    • 0.3.0
      • Breaking change
      • Other changes
  • Installation
    • Pre-build binaries
    • Manual build
      • With cmake
        • Cmake options:
      • With setuptools
  • Developing c++ extensions
  • Examples
    • Component trees
    • Hierarchical segmentation
    • Triangular meshes
    • Useful tools
    • Illustrative applications from scientific papers
  • Troubleshooting

Fundamentals

  • Graphs
    • Vertices
      • Iterating on vertices
    • Edges
      • Iterating on edges
    • Degrees
    • Weighted graph
  • Trees
    • Constructor
    • Basic functions
    • Iterators
    • Children relation
    • Finding nodes
    • Accumulators
      • Parallel accumulator
      • Sequential accumulator
      • Sequential and combine accumulator
    • Propagators
      • Conditional parallel propagator
      • Conditional sequential propagator
      • Sequential propagate and accumulate
      • Conditional sequential propagate and accumulate

Python API

  • Hierarchy core functions
    • bpt_canonical()
    • canonize_hierarchy()
    • quasi_flat_zone_hierarchy()
    • simplify_tree()
    • tree_2_binary_tree()
    • saliency()
  • Hierarchy construction algorithms
    • Binary partition hierarchy
      • binary_partition_tree_single_linkage()
      • binary_partition_tree_complete_linkage()
      • binary_partition_tree_average_linkage()
      • binary_partition_tree_exponential_linkage()
      • binary_partition_tree_ward_linkage()
      • binary_partition_tree_MumfordShah_energy()
      • binary_partition_tree()
    • Component tree
      • component_tree_min_tree()
      • component_tree_max_tree()
    • Constrained connectivity hierarchy
      • constrained_connectivity_hierarchy_alpha_omega()
      • constrained_connectivity_hierarchy_strong_connection()
    • Random hierarchy
      • random_binary_partition_tree()
    • Watershed hierarchy
      • watershed_hierarchy_by_attribute()
      • watershed_hierarchy_by_minima_ordering()
      • watershed_hierarchy_by_area()
      • watershed_hierarchy_by_volume()
      • watershed_hierarchy_by_dynamics()
      • watershed_hierarchy_by_number_of_parents()
  • Hierarchy processing algorithms
    • Alignment
      • align_hierarchies()
      • project_fine_to_coarse_rag()
      • project_fine_to_coarse_labelisation()
    • Horizontal cut
      • labelisation_horizontal_cut_from_num_regions()
      • labelisation_horizontal_cut_from_threshold()
      • HorizontalCutExplorer
        • HorizontalCutExplorer.__init__()
        • HorizontalCutExplorer.__new__()
        • HorizontalCutExplorer.altitude_cut()
        • HorizontalCutExplorer.altitude_cuts()
        • HorizontalCutExplorer.horizontal_cut_from_altitude()
        • HorizontalCutExplorer.horizontal_cut_from_index()
        • HorizontalCutExplorer.horizontal_cut_from_num_regions()
        • HorizontalCutExplorer.num_cuts()
        • HorizontalCutExplorer.num_regions_cut()
        • HorizontalCutExplorer.num_regions_cuts()
      • HorizontalCutNodes
        • HorizontalCutNodes.__init__()
        • HorizontalCutNodes.altitude()
        • HorizontalCutNodes.graph_cut()
        • HorizontalCutNodes.labelisation_leaves()
        • HorizontalCutNodes.nodes()
        • HorizontalCutNodes.reconstruct_leaf_data()
    • Tree accumulators
      • propagate_parallel()
      • propagate_sequential()
      • propagate_sequential_and_accumulate()
      • accumulate_parallel()
      • accumulate_sequential()
      • accumulate_and_add_sequential()
      • accumulate_and_multiply_sequential()
      • accumulate_and_max_sequential()
      • accumulate_and_min_sequential()
      • accumulate_on_contours()
    • Tree algorithms
      • binary_labelisation_from_markers()
      • filter_non_relevant_node_from_tree()
      • filter_small_nodes_from_tree()
      • filter_weak_frontier_nodes_from_tree()
      • labelisation_hierarchy_supervertices()
      • reconstruct_leaf_data()
      • sort_hierarchy_with_altitudes()
      • test_altitudes_increasingness()
      • test_tree_isomorphism()
      • tree_fusion_depth_map()
      • tree_monotonic_regression()
    • Tree attributes
      • attribute_area()
      • attribute_child_number()
      • attribute_contour_length()
      • attribute_contour_strength()
      • attribute_compactness()
      • attribute_depth()
      • attribute_dynamics()
      • attribute_extinction_value()
      • attribute_extrema()
      • attribute_frontier_length()
      • attribute_frontier_strength()
      • attribute_gaussian_region_weights_model()
      • attribute_height()
      • attribute_lca_map()
      • attribute_mean_vertex_weights()
      • attribute_moment_of_inertia()
      • attribute_children_pair_sum_product()
      • attribute_piecewise_constant_Mumford_Shah_energy()
      • attribute_regular_altitudes()
      • attribute_sibling()
      • attribute_topological_height()
      • attribute_tree_sampling_probability()
      • attribute_volume()
    • Tree energy optimization
      • labelisation_optimal_cut_from_energy()
      • hierarchy_to_optimal_energy_cut_hierarchy()
      • hierarchy_to_optimal_MumfordShah_energy_cut_hierarchy()
  • Quality Assessment
    • Hierarchical cost
      • dasgupta_cost()
      • dendrogram_purity()
      • tree_sampling_divergence()
    • Hierarchy fragmentation curve
      • FragmentationCurve
        • FragmentationCurve.__init__()
        • FragmentationCurve.num_regions()
        • FragmentationCurve.num_regions_ground_truth()
        • FragmentationCurve.num_regions_normalized()
        • FragmentationCurve.scores()
      • OptimalCutMeasure
        • OptimalCutMeasure.BCE
        • OptimalCutMeasure.DCovering
        • OptimalCutMeasure.DHamming
        • OptimalCutMeasure.__eq__()
        • OptimalCutMeasure.__getstate__()
        • OptimalCutMeasure.__hash__()
        • OptimalCutMeasure.__index__()
        • OptimalCutMeasure.__init__()
        • OptimalCutMeasure.__int__()
        • OptimalCutMeasure.__members__
        • OptimalCutMeasure.__module__
        • OptimalCutMeasure.__ne__()
        • OptimalCutMeasure.__repr__()
        • OptimalCutMeasure.__setstate__()
        • OptimalCutMeasure.__str__()
        • OptimalCutMeasure.name
        • OptimalCutMeasure.value
      • assess_fragmentation_horizontal_cut()
      • assess_fragmentation_optimal_cut()
      • make_assesser_fragmentation_optimal_cut()
      • AssesserFragmentationOptimalCut
        • AssesserFragmentationOptimalCut.fragmentation_curve()
        • AssesserFragmentationOptimalCut.optimal_number_of_regions()
        • AssesserFragmentationOptimalCut.optimal_partition()
        • AssesserFragmentationOptimalCut.optimal_score()
    • Partition score
      • PartitionMeasure
        • PartitionMeasure.BCE
        • PartitionMeasure.DCovering
        • PartitionMeasure.DHamming
        • PartitionMeasure.name
        • PartitionMeasure.value
      • assess_partition()
  • Graph processing algorithms
    • Bipartite graph
      • bipartite_graph_matching()
      • is_bipartite_graph()
    • Graph accumulators
      • accumulate_graph_edges()
      • accumulate_graph_vertices()
    • Graph attributes
      • attribute_edge_length()
      • attribute_vertex_area()
      • attribute_vertex_coordinates()
      • attribute_vertex_list()
      • attribute_vertex_perimeter()
    • Graph core
      • adjacency_matrix_2_undirected_graph()
      • graph_cut_2_labelisation()
      • labelisation_2_graph_cut()
      • line_graph()
      • make_graph_from_points()
      • minimum_spanning_tree()
      • subgraph()
      • undirected_graph_2_adjacency_matrix()
      • ultrametric_open()
    • Graph weighting
      • WeightFunction
        • WeightFunction.L0
        • WeightFunction.L1
        • WeightFunction.L2
        • WeightFunction.L2_squared
        • WeightFunction.L_infinity
        • WeightFunction.max
        • WeightFunction.mean
        • WeightFunction.min
        • WeightFunction.name
        • WeightFunction.source
        • WeightFunction.target
        • WeightFunction.value
      • weight_graph()
    • Region adjacency graph
      • make_region_adjacency_graph_from_labelisation()
      • make_region_adjacency_graph_from_graph_cut()
      • rag_back_project_vertex_weights()
      • rag_back_project_edge_weights()
      • rag_accumulate_on_vertices()
      • rag_accumulate_on_edges()
    • Watershed
      • labelisation_watershed()
      • labelisation_seeded_watershed()
  • Data structures
    • Accumulators
      • Accumulators
        • Accumulators.argmax
        • Accumulators.argmin
        • Accumulators.counter
        • Accumulators.first
        • Accumulators.last
        • Accumulators.max
        • Accumulators.mean
        • Accumulators.min
        • Accumulators.name
        • Accumulators.prod
        • Accumulators.sum
        • Accumulators.value
      • accumulate_at()
    • Concepts
      • Concept
        • Concept.construct()
        • Concept.description()
        • Concept.validate()
      • CptGridGraph
        • CptGridGraph.get_shape()
      • CptRegionAdjacencyGraph
        • CptRegionAdjacencyGraph.get_edge_map()
        • CptRegionAdjacencyGraph.get_pre_graph()
        • CptRegionAdjacencyGraph.get_vertex_map()
      • CptHierarchy
        • CptHierarchy.get_leaf_graph()
      • CptBinaryHierarchy
        • CptBinaryHierarchy.get_mst()
        • CptBinaryHierarchy.get_mst_edge_map()
      • CptMinimumSpanningTree
        • CptMinimumSpanningTree.get_base_graph()
        • CptMinimumSpanningTree.get_edge_map()
    • EmbeddingGrid
      • EmbeddingGrid2d
        • EmbeddingGrid2d.__init__()
        • EmbeddingGrid2d.__reduce__()
        • EmbeddingGrid2d.contains()
        • EmbeddingGrid2d.dimension()
        • EmbeddingGrid2d.grid2lin()
        • EmbeddingGrid2d.lin2grid()
        • EmbeddingGrid2d.shape()
        • EmbeddingGrid2d.size()
    • LCAFast
      • make_lca_fast()
      • LCAFast
    • RegularGraph
      • RegularGraph2d
        • RegularGraph2d.__init__()
        • RegularGraph2d.__new__()
        • RegularGraph2d.__reduce__()
        • RegularGraph2d.adjacent_vertices()
        • RegularGraph2d.as_explicit_graph()
        • RegularGraph2d.degree()
        • RegularGraph2d.in_degree()
        • RegularGraph2d.in_edges()
        • RegularGraph2d.neighbour_list()
        • RegularGraph2d.num_vertices()
        • RegularGraph2d.out_degree()
        • RegularGraph2d.out_edges()
        • RegularGraph2d.shape()
        • RegularGraph2d.source()
        • RegularGraph2d.target()
        • RegularGraph2d.vertices()
    • Tree
      • TreeCategory
        • TreeCategory.ComponentTree
        • TreeCategory.PartitionTree
        • TreeCategory.name
        • TreeCategory.value
      • Tree
        • Tree.__init__()
        • Tree.__reduce__()
        • Tree.adjacent_vertices()
        • Tree.ancestors()
        • Tree.category()
        • Tree.child()
        • Tree.children()
        • Tree.clear_children()
        • Tree.degree()
        • Tree.edge_from_index()
        • Tree.edge_list()
        • Tree.edges()
        • Tree.find_region()
        • Tree.in_degree()
        • Tree.in_edges()
        • Tree.index()
        • Tree.is_leaf()
        • Tree.leaves()
        • Tree.leaves_to_root_iterator()
        • Tree.lowest_common_ancestor()
        • Tree.lowest_common_ancestor_preprocess()
        • Tree.num_children()
        • Tree.num_edges()
        • Tree.num_leaves()
        • Tree.num_vertices()
        • Tree.out_degree()
        • Tree.out_edges()
        • Tree.parent()
        • Tree.parents()
        • Tree.root()
        • Tree.root_to_leaves_iterator()
        • Tree.source()
        • Tree.sources()
        • Tree.sub_tree()
        • Tree.target()
        • Tree.targets()
        • Tree.to_undirected_graph()
        • Tree.vertices()
    • UndirectedGraph
      • UndirectedGraph
        • UndirectedGraph.__init__()
        • UndirectedGraph.__reduce__()
        • UndirectedGraph.add_edge()
        • UndirectedGraph.add_edges()
        • UndirectedGraph.add_vertex()
        • UndirectedGraph.add_vertices()
        • UndirectedGraph.adjacent_vertices()
        • UndirectedGraph.degree()
        • UndirectedGraph.edge_from_index()
        • UndirectedGraph.edge_list()
        • UndirectedGraph.edges()
        • UndirectedGraph.in_degree()
        • UndirectedGraph.in_edges()
        • UndirectedGraph.index()
        • UndirectedGraph.num_edges()
        • UndirectedGraph.num_vertices()
        • UndirectedGraph.out_degree()
        • UndirectedGraph.out_edges()
        • UndirectedGraph.remove_edge()
        • UndirectedGraph.set_edge()
        • UndirectedGraph.source()
        • UndirectedGraph.sources()
        • UndirectedGraph.target()
        • UndirectedGraph.targets()
        • UndirectedGraph.vertices()
  • Interoperability
    • SciPy
      • binary_hierarchy_to_scipy_linkage_matrix()
      • scipy_linkage_matrix_to_binary_hierarchy()
  • Image applications
    • Contour 2d modelisation
      • fit_contour_2d()
      • Contour2d
        • Contour2d.__getitem__()
        • Contour2d.__init__()
        • Contour2d.__iter__()
        • Contour2d.__len__()
        • Contour2d.subdivide()
      • PolylineContour2d
        • PolylineContour2d.__getitem__()
        • PolylineContour2d.__init__()
        • PolylineContour2d.__iter__()
        • PolylineContour2d.__len__()
        • PolylineContour2d.subdivide()
      • ContourSegment2d
        • ContourSegment2d.__getitem__()
        • ContourSegment2d.__init__()
        • ContourSegment2d.__iter__()
        • ContourSegment2d.__len__()
        • ContourSegment2d.angle()
        • ContourSegment2d.distance_to_point()
        • ContourSegment2d.norm()
    • Graph image
      • graph_4_adjacency_2_khalimsky()
      • khalimsky_2_graph_4_adjacency()
      • get_4_adjacency_graph()
      • get_8_adjacency_graph()
      • get_4_adjacency_implicit_graph()
      • get_8_adjacency_implicit_graph()
      • get_nd_regular_graph()
      • get_nd_regular_implicit_graph()
      • mask_2_neighbours()
      • match_pixels_image_2d()
    • Mean probability boundary hierarchy
      • oriented_watershed()
      • mean_pb_hierarchy()
      • multiscale_mean_pb_hierarchy()
    • Tree of shapes
      • component_tree_tree_of_shapes_image2d()
      • component_tree_multivariate_tree_of_shapes_image2d()
  • IO
    • Pink Graph
      • read_graph_pink()
      • save_graph_pink()
    • Tree IO
      • print_partition_tree()
      • read_tree()
      • save_tree()
    • Plotting
      • plot_graph()
      • plot_partition_tree()
  • Misc
    • Data cache
      • list_attributes()
      • get_attribute()
      • set_attribute()
      • auto_cache()
      • set_auto_cache_state()
      • get_auto_cache_state()
      • clear_auto_cache()
    • Utility functions
      • arg_sort()
      • sort()
      • set_num_threads()
      • is_iterable()
      • extend_class()
      • normalize_shape()
      • linearize_vertex_weights()
      • delinearize_vertex_weights()
      • has_method()
      • is_in_bijection()
      • mean_angle_mod_pi()
      • dtype_info()
      • common_type()
      • cast_to_common_type()
      • cast_to_dtype()
      • get_include()
      • get_lib_include()
      • get_lib_cmake()

c++ API

  • Arrays
    • Quick start
      • Creating arrays
      • Properties
      • Element access
      • Display
      • Lazy Evaluation
  • HG namespace
    • accumulators
      • accumulators::first
      • accumulators::last
      • accumulators::mean
      • accumulators::min
      • accumulators::max
      • accumulators::counter
      • accumulators::sum
      • accumulators::prod
      • accumulators::argmin
      • accumulators::argmax
    • weight_functions
      • weight_functions::mean
      • weight_functions::min
      • weight_functions::max
      • weight_functions::L0
      • weight_functions::L1
      • weight_functions::L2
      • weight_functions::L_infinity
      • weight_functions::L2_squared
      • weight_functions::source
      • weight_functions::target
    • optimal_cut_measure
      • optimal_cut_measure::BCE
      • optimal_cut_measure::DHamming
      • optimal_cut_measure::DCovering
    • partition_measure
      • partition_measure::BCE
      • partition_measure::DHamming
      • partition_measure::DCovering
    • tos_padding
      • tos_padding::none
      • tos_padding::mean
      • tos_padding::zero
    • tree_category
      • tree_category::component_tree
      • tree_category::partition_tree
    • leaves_it
      • leaves_it::include
      • leaves_it::exclude
    • root_it
      • root_it::include
      • root_it::exclude
    • contour_2d
    • polyline_contour_2d
    • contour_segment_2d
    • array_1d
    • array_2d
    • array_3d
    • array_4d
    • array_nd
    • embedding_grid
    • embedding_grid_1d
    • embedding_grid_2d
    • embedding_grid_3d
    • embedding_grid_4d
    • fibonacci_heap
    • lca_sparse_table_block
    • lca_sparse_table
    • lca_fast
    • point
    • point_1d_f
    • point_1d_i
    • point_2d_f
    • point_2d_i
    • point_3d_f
    • point_3d_i
    • point_4d_f
    • point_4d_i
    • regular_graph
    • regular_grid_graph_1d
    • regular_grid_graph_2d
    • regular_grid_graph_3d
    • regular_grid_graph_4d
    • regular_graph_out_edge_iterator
    • regular_graph_adjacent_vertex_iterator
    • tree
    • vecS
    • hash_setS
    • undirected_graph
    • ugraph
    • union_find
    • index_t
    • size_t
    • stackv
    • invalid_index
    • accumulate_at()
    • accumulate_graph_edges()
    • accumulate_graph_vertices()
    • accumulate_parallel()
    • accumulate_sequential()
    • accumulate_and_combine_sequential()
    • propagate_parallel()
    • propagate_parallel()
    • propagate_sequential()
    • propagate_sequential_and_accumulate()
    • propagate_sequential_and_accumulate()
    • accumulate_on_contours()
    • project_fine_to_coarse_labelisation()
    • project_fine_to_coarse_rag()
    • make_hierarchy_aligner_from_graph_cut()
    • make_hierarchy_aligner_from_labelisation()
    • make_hierarchy_aligner_from_hierarchy()
    • is_bipartite_graph()
    • is_bipartite_graph()
    • bipartite_graph_matching()
    • graph_cut_2_labelisation()
    • labelisation_2_graph_cut()
    • minimum_spanning_tree()
    • subgraph_spanning()
    • line_graph()
    • line_graph()
    • weight_graph()
    • weight_graph()
    • make_horizontal_cut_nodes()
    • make_horizontal_cut_explorer()
    • make_region_adjacency_graph_from_labelisation()
    • make_region_adjacency_graph_from_graph_cut()
    • rag_back_project_weights()
    • rag_accumulate()
    • reconstruct_leaf_data()
    • labelisation_horizontal_cut_from_threshold()
    • labelisation_hierarchy_supervertices()
    • supervertices_hierarchy()
    • test_tree_isomorphism()
    • binary_labelisation_from_markers()
    • sort_hierarchy_with_altitudes()
    • sub_tree()
    • labelisation_optimal_cut_from_energy()
    • hierarchy_to_optimal_energy_cut_hierarchy()
    • binary_partition_tree_MumfordShah_energy()
    • tree_fusion_depth_map()
    • tree_fusion_depth_map()
    • tree_monotonic_regression()
    • tree_monotonic_regression()
    • labelisation_watershed()
    • labelisation_seeded_watershed()
    • dendrogram_purity()
    • assess_fragmentation_horizontal_cut()
    • card_intersections()
    • assess_partition()
    • assess_partition()
    • attribute_area()
    • attribute_area()
    • attribute_volume()
    • attribute_depth()
    • attribute_height()
    • attribute_extrema()
    • attribute_extinction_value()
    • attribute_dynamics()
    • attribute_sibling()
    • attribute_contour_length_component_tree()
    • attribute_child_number()
    • attribute_smallest_enclosing_shape()
    • attribute_children_pair_sum_product()
    • source()
    • sources()
    • target()
    • targets()
    • vertex_iterator()
    • edge_iterator()
    • out_edge_iterator()
    • in_edge_iterator()
    • adjacent_vertex_iterator()
    • children_iterator()
    • ancestors_iterator()
    • degree()
    • in_degree()
    • out_degree()
    • add_edges()
    • copy_graph()
    • copy_graph()
    • copy_graph()
    • other_vertex()
    • undirected_graph_2_adjacency_matrix()
    • adjacency_matrix_2_undirected_graph()
    • binary_partition_tree()
    • binary_partition_tree_min_linkage()
    • binary_partition_tree_complete_linkage()
    • binary_partition_tree_average_linkage()
    • binary_partition_tree_exponential_linkage()
    • binary_partition_tree_ward_linkage()
    • make_node_weighted_tree()
    • make_remapped_tree()
    • component_tree_max_tree()
    • component_tree_min_tree()
    • make_node_weighted_tree_and_mst()
    • bpt_canonical()
    • simplify_tree()
    • quasi_flat_zone_hierarchy()
    • saliency_map()
    • tree_2_binary_tree()
    • watershed_hierarchy_by_attribute()
    • watershed_hierarchy_by_minima_ordering()
    • watershed_hierarchy_by_area()
    • watershed_hierarchy_by_area()
    • watershed_hierarchy_by_volume()
    • watershed_hierarchy_by_volume()
    • watershed_hierarchy_by_dynamics()
    • fit_contour_2d()
    • rag_2d_vertex_perimeter_and_edge_length()
    • rag_2d_vertex_perimeter_and_edge_length()
    • get_4_adjacency_implicit_graph()
    • get_8_adjacency_implicit_graph()
    • get_4_adjacency_graph()
    • get_8_adjacency_graph()
    • graph_4_adjacency_2_khalimsky()
    • khalimsky_2_graph_4_adjacency()
    • khalimsky_2_graph_4_adjacency()
    • get_bipartite_matching_graph_contour_image_2d()
    • oriented_watershed()
    • mean_pb_hierarchy()
    • component_tree_tree_of_shapes_image2d()
    • read_pink_graph()
    • read_pink_graph()
    • save_pink_graph()
    • save_pink_graph()
    • read_image_pnm()
    • save_image_pnm()
    • save_tree()
    • read_tree()
    • stable_sort()
    • sort()
    • stable_sort()
    • stable_sort()
    • stable_sort()
    • sort()
    • sort()
    • sort()
    • arg_sort()
    • arg_sort()
    • stable_arg_sort()
    • stable_arg_sort()
    • source()
    • target()
    • index()
    • make_light_axis_view()
    • out_edges()
    • in_edges()
    • num_vertices()
    • vertices()
    • adjacent_vertices()
    • out_degree()
    • in_degree()
    • degree()
    • num_leaves()
    • num_children()
    • num_children()
    • category()
    • root()
    • parent()
    • parent()
    • is_leaf()
    • is_leaf()
    • parents()
    • leaves_to_root_iterator()
    • root_to_leaves_iterator()
    • leaves_iterator()
    • ancestors()
    • edge_from_index()
    • children()
    • child()
    • child()
    • num_vertices()
    • num_edges()
    • degree()
    • in_degree()
    • out_degree()
    • vertices()
    • edges()
    • adjacent_vertices()
    • out_edges()
    • in_edges()
    • find_region()
    • find_region()
    • lowest_common_ancestor()
    • lowest_common_ancestor()
    • edge_from_index()
    • num_vertices()
    • num_edges()
    • degree()
    • in_degree()
    • out_degree()
    • add_vertex()
    • add_vertices()
    • add_edge()
    • remove_edge()
    • set_edge()
    • vertices()
    • edges()
    • out_edges()
    • in_edges()
    • adjacent_vertices()
    • parfor()
    • extend()
    • unreachable()
    • accumulator_argmax
      • accumulator_argmax::make_accumulator()
      • accumulator_argmax::get_output_shape()
    • accumulator_argmin
      • accumulator_argmin::make_accumulator()
      • accumulator_argmin::get_output_shape()
    • accumulator_counter
      • accumulator_counter::make_accumulator()
      • accumulator_counter::get_output_shape()
    • accumulator_first
      • accumulator_first::make_accumulator()
      • accumulator_first::get_output_shape()
    • accumulator_last
      • accumulator_last::make_accumulator()
      • accumulator_last::get_output_shape()
    • accumulator_max
      • accumulator_max::make_accumulator()
      • accumulator_max::get_output_shape()
      • accumulator_max::init_value()
      • accumulator_max::reduce()
    • accumulator_mean
      • accumulator_mean::make_accumulator()
      • accumulator_mean::get_output_shape()
    • accumulator_min
      • accumulator_min::make_accumulator()
      • accumulator_min::get_output_shape()
      • accumulator_min::init_value()
      • accumulator_min::reduce()
    • accumulator_prod
      • accumulator_prod::make_accumulator()
      • accumulator_prod::get_output_shape()
      • accumulator_prod::init_value()
      • accumulator_prod::reduce()
    • accumulator_sum
      • accumulator_sum::make_accumulator()
      • accumulator_sum::get_output_shape()
      • accumulator_sum::init_value()
      • accumulator_sum::reduce()
    • assesser_fragmentation_optimal_cut
      • assesser_fragmentation_optimal_cut::assesser_fragmentation_optimal_cut()
      • assesser_fragmentation_optimal_cut::fragmentation_curve()
      • assesser_fragmentation_optimal_cut::optimal_number_of_regions()
      • assesser_fragmentation_optimal_cut::optimal_score()
      • assesser_fragmentation_optimal_cut::optimal_partition()
      • assesser_fragmentation_optimal_cut::straightened_altitudes()
    • COMPILE_ERROR
    • counting_iterator
      • counting_iterator::self_type
      • counting_iterator::counting_iterator()
      • counting_iterator::counting_iterator()
      • counting_iterator::increment()
      • counting_iterator::decrement()
      • counting_iterator::advance()
      • counting_iterator::distance_to()
      • counting_iterator::equal()
      • counting_iterator::dereference()
    • forward_iterator_facade
      • forward_iterator_facade::self_type
      • forward_iterator_facade::value_type
      • forward_iterator_facade::difference_type
      • forward_iterator_facade::reference
      • forward_iterator_facade::pointer
      • forward_iterator_facade::iterator_category
      • forward_iterator_facade::operator*()
      • forward_iterator_facade::operator++()
      • forward_iterator_facade::operator++()
      • forward_iterator_facade::operator==()
      • forward_iterator_facade::operator!=()
    • fragmentation_curve
      • fragmentation_curve::fragmentation_curve()
      • fragmentation_curve::num_regions_ground_truth()
      • fragmentation_curve::optimal_number_of_regions()
      • fragmentation_curve::optimal_score()
      • fragmentation_curve::scores()
      • fragmentation_curve::num_regions()
      • fragmentation_curve::num_regions_normalized()
    • hierarchy_aligner
      • hierarchy_aligner::hierarchy_aligner()
      • hierarchy_aligner::align_hierarchy()
      • hierarchy_aligner::align_hierarchy()
      • hierarchy_aligner::align_hierarchy()
    • horizontal_cut_explorer
      • horizontal_cut_explorer::tree_type
      • horizontal_cut_explorer::value_type
      • horizontal_cut_explorer::horizontal_cut_explorer()
      • horizontal_cut_explorer::num_cuts()
      • horizontal_cut_explorer::num_regions_cut()
      • horizontal_cut_explorer::num_regions_cuts()
      • horizontal_cut_explorer::altitude_cut()
      • horizontal_cut_explorer::altitude_cuts()
      • horizontal_cut_explorer::horizontal_cut_from_index()
      • horizontal_cut_explorer::horizontal_cut_from_altitude()
      • horizontal_cut_explorer::horizontal_cut_from_num_regions()
    • horizontal_cut_nodes
      • horizontal_cut_nodes::horizontal_cut_nodes()
      • horizontal_cut_nodes::labelisation_leaves()
      • horizontal_cut_nodes::reconstruct_leaf_data()
      • horizontal_cut_nodes::graph_cut()
      • horizontal_cut_nodes::nodes
      • horizontal_cut_nodes::altitude
    • indexed_edge
      • indexed_edge::indexed_edge()
      • indexed_edge::indexed_edge()
      • indexed_edge::operator edge_index_t()
      • indexed_edge::operator std::pair<vertex_descriptor, vertex_descriptor>()
      • indexed_edge::source
      • indexed_edge::first
      • indexed_edge::@3
      • indexed_edge::target
      • indexed_edge::second
      • indexed_edge::@5
      • indexed_edge::index
    • irange
      • irange::irange()
      • irange::irange()
      • irange::begin()
      • irange::end()
    • iterator_wrapper
      • iterator_wrapper::iterator_wrapper()
      • iterator_wrapper::iterator_wrapper()
      • iterator_wrapper::begin()
      • iterator_wrapper::end()
      • iterator_wrapper::begin()
      • iterator_wrapper::end()
      • iterator_wrapper::first
      • iterator_wrapper::last
    • logger
      • logger::callback_list
      • logger::trace_enabled()
      • logger::callbacks()
      • logger::emit()
      • logger::MAX_MSG_SIZE
    • minimum_spanning_tree_result
      • minimum_spanning_tree_result::mst
      • minimum_spanning_tree_result::mst_edge_map
    • node_weighted_tree
      • node_weighted_tree::tree
      • node_weighted_tree::altitudes
    • node_weighted_tree_and_mst
      • node_weighted_tree_and_mst::tree
      • node_weighted_tree_and_mst::altitudes
      • node_weighted_tree_and_mst::mst_edge_map
    • pink_graph
      • pink_graph::graph
      • pink_graph::shape
      • pink_graph::vertex_weights
      • pink_graph::edge_weights
    • random_iterator_facade
      • random_iterator_facade::self_type
      • random_iterator_facade::value_type
      • random_iterator_facade::difference_type
      • random_iterator_facade::reference
      • random_iterator_facade::pointer
      • random_iterator_facade::iterator_category
      • random_iterator_facade::operator[]()
      • random_iterator_facade::operator*()
      • random_iterator_facade::operator++()
      • random_iterator_facade::operator++()
      • random_iterator_facade::operator--()
      • random_iterator_facade::operator--()
      • random_iterator_facade::operator==()
      • random_iterator_facade::operator!=()
      • random_iterator_facade::operator<=()
      • random_iterator_facade::operator<()
      • random_iterator_facade::operator>=()
      • random_iterator_facade::operator>()
      • random_iterator_facade::operator-()
      • random_iterator_facade::operator+()
      • random_iterator_facade::operator+()
    • region_adjacency_graph
      • region_adjacency_graph::rag
      • region_adjacency_graph::vertex_map
      • region_adjacency_graph::edge_map
    • remapped_tree
      • remapped_tree::tree
      • remapped_tree::node_map
    • scorer_partition_BCE
      • scorer_partition_BCE::score()
    • scorer_partition_DCovering
      • scorer_partition_DCovering::score()
    • scorer_partition_DHamming
      • scorer_partition_DHamming::score()
    • supervertex_hierarchy
      • supervertex_hierarchy::supervertex_labelisation
      • supervertex_hierarchy::tree
      • supervertex_hierarchy::node_map
    • transform_forward_iterator
      • transform_forward_iterator::self_type
      • transform_forward_iterator::increment()
      • transform_forward_iterator::equal()
      • transform_forward_iterator::dereference()
      • transform_forward_iterator::transform_forward_iterator()
      • transform_forward_iterator::transform_forward_iterator()
      • transform_forward_iterator::transform_forward_iterator()

Contributing

  • Contributing
    • Working on the C++ backend
    • Working on the Python frontend
    • Pushing a new version
Higra
  • IO
  • Edit on GitHub

IO

  • Pink Graph
    • read_graph_pink()
    • save_graph_pink()
  • Tree IO
    • print_partition_tree()
    • read_tree()
    • save_tree()
  • Plotting
    • plot_graph()
    • plot_partition_tree()
Previous Next

© Copyright 2018, Benjamin Perret. Revision 929f41ea.

Built with Sphinx using a theme provided by Read the Docs.