| CCah< T > | |
| ▼CCahElementFactory< T > | |
| CBaryCahElementFactory< T > | |
| CMax2By2DistanceCahElementFactory< T > | |
| CPPcaCahElementFactory< T > | |
| CPcaCahElementFactory< T > | |
| CPcaReprocReconsErrorCahElementFactory< T > | |
| CSCKBDistanceCahElementFactory< T > | |
| ▼Cstd::map< K, T >::const_iterator | STL iterator class |
| Cbio::CoustyFlowMap< PointVertexRef< Point4dl >, L >::iterator | |
| Cbio::CoustyWatershed< T, L > | Watershed implementation as described in Cousty et al - Watershed cuts: minimum spanning forests and the drop of water principle (2007) The computation is done in linear time |
| ▼CElement< T > | |
| CBaryElement< T > | |
| CMax2By2DistanceElement< T > | |
| CPPcaElement< T > | |
| CPcaElement< T > | |
| CPcaReprocReconsErrorElement< T > | |
| CSCKBDistanceElement< T > | |
| Cbio::ExtremaFinder | |
| ▼Cstd::map< K, T > | STL class |
| Cbio::CoustyFlowMap< PointVertexRef< Point4dl >, L >::const_iterator | |
| Cbio::CoustyFlowMap< PointVertexRef< Point4dl >, L >::iterator | |
| Cbio::CoustyFlowMap< V, L > | A flow map is a mapping of the vertices of a graph to a value |
| CParameterizedHelper< DataType > | |
| ▼Ccarto::rc_ptr | |
| Cbio::CoustyFlowMapRef< Vertex, L > | |
| Cbio::CoustyFlowMapRef< PointVertexRef< Point4dl >, L > | Reference counting pointer to a CoustyFlowMap |
| Cbio::CoustyStreamRef< Vertex > | |
| ▼Cbio::BaseEdgeRef< V > | Reference counting pointer to a BaseEdge |
| Cbio::SetEdgeRef< V > | Reference counting pointer to a SetEdge |
| ▼Cbio::BaseGraphRef< E > | Reference to a BaseGraph |
| ▼Cbio::EWBaseGraphRef< SetEdgeRef< PointVertexRef< P > >, T > | |
| Cbio::VolumeGraphRef< T, P > | Reference to a VolumeGraph |
| ▼Cbio::EWBaseGraphRef< E, W > | Reference to a EWBaseGraph |
| Cbio::VolumeGraphRef< T, Point > | |
| ▼Cbio::BaseVertexRef | Reference counting pointer to a BaseVertex |
| Cbio::PointVertexRef< Point4dl > | |
| Cbio::PointVertexRef< P > | Reference counting pointer to a PointVertex |
| Cbio::ValueVertexRef< T > | Reference counting pointer to a ValueVertex |
| Cbio::CoustyFlowMapRef< V, L > | Reference counting pointer to a CoustyFlowMap |
| Cbio::CoustyFlowMapRef< PointVertexRef< Point4dl >, L > | Reference counting pointer to a CoustyFlowMap |
| Cbio::CoustyStreamRef< V > | Reference counting pointer to a CoustyStream |
| ▼Ccarto::RCObject | |
| ▼Cbio::BaseGraph< SetEdgeRef< PointVertexRef< P > > > | |
| ▼Cbio::EWBaseGraph< SetEdgeRef< PointVertexRef< P > >, T > | |
| ▼Cbio::VolumeGraph< T, P >::edge_const_iterator | Iterator on the edges of a volume graph |
| Cbio::VolumeGraph< T, P >::edge_iterator | |
| Cbio::VolumeGraph< T, P >::edge_iterator | |
| ▼Cbio::VolumeGraph< T, P >::vertex_const_iterator | Iterator on the vertices of a volume graph |
| Cbio::VolumeGraph< T, P >::vertex_iterator | |
| Cbio::VolumeGraph< T, P >::vertex_iterator | |
| Cbio::VolumeGraph< T, P > | Volume graphs are a graph implementation specifically designed to represent volumes as graphs (vertices are the voxels, and edges are a chosen connectivity) |
| Cbio::CoustyFlowMap< PointVertexRef< Point4dl >, L >::const_iterator | |
| Cbio::CoustyFlowMap< PointVertexRef< Point4dl >, L >::iterator | |
| ▼Cbio::BaseEdge< V > | Base class for edges |
| Cbio::SetEdge< V > | Edges: set implementation of non-oriented edges |
| ▼Cbio::BaseGraph< E > | Base class for graphs |
| Cbio::EWBaseGraph< E, W > | Base class for edge weighted graphs |
| ▼Cbio::BaseVertex | Base class for vertices |
| Cbio::PointVertex< P > | Coordinates-defined vertices |
| Cbio::ValueVertex< T > | Vertices with value |
| Cbio::CoustyFlowMap< V, L > | A flow map is a mapping of the vertices of a graph to a value |
| Cbio::CoustyStream< V > | Streams represent a descent path in a graph |
| Cbioprocessing::ScalarFeature< FeatureType > | |
| Cbioprocessing::ScalarFeatureType | |
| ▼Cstd::set< K > | STL class |
| Cbio::CoustyStream< V > | Streams represent a descent path in a graph |
| Cbio::Watershed< T, L > | Interface to watershed implementations |
1.13.2