Welcome to Higra’s documentation!

Informations

• Changelog
• Installation
• Developing c++ extensions
• Examples
• Troubleshooting

Fundamentals

• Graphs
  • Vertices
  • Edges
  • Degrees
  • Weighted graph
• Trees
  • Constructor
  • Basic functions
  • Iterators
  • Children relation
  • Finding nodes
  • Accumulators
  • Propagators

Python API

• Hierarchy core functions
• Hierarchy construction algorithms
  • Binary partition hierarchy
  • Component tree
  • Constrained connectivity hierarchy
  • Random hierarchy
  • Watershed hierarchy
• Hierarchy processing algorithms
  • Alignment
  • Horizontal cut
  • Tree accumulators
  • Tree algorithms
  • Tree attributes
  • Tree energy optimization
• Quality Assessment
  • Hierarchical cost
  • Hierarchy fragmentation curve
  • Partition score
• Graph processing algorithms
  • Graph accumulators
  • Graph attributes
  • Graph core
  • Graph weighting
  • Region adjacency graph
  • Watershed
• Data structures
  • Accumulators
  • Concepts
  • EmbeddingGrid
  • LCAFast
  • RegularGraph
  • Tree
  • UndirectedGraph
• Interoperability
  • SciPy
• Image applications
  • Contour 2d modelisation
  • Graph image
  • Mean probability boundary hierarchy
  • Tree of shapes
• IO
  • Pink Graph
  • Tree IO
  • Plotting
• Misc
  • Data cache
  • Utility functions

c++ API

• Arrays
  • Quick start
    • Creating arrays
    • Properties
    • Element access
    • Display
    • Lazy Evaluation
• HG namespace

Contributing

• Contributing
  • Working on the C++ backend
  • Working on the Python frontend
  • Pushing a new version

• Index