| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Math.Clumpiness.Pinpoint
- getValidPropertyMap :: (Ord a, Ord b) => Tree (SuperNode a) -> PropertyMap a b -> PropertyMap a b
- rootSubtree :: Tree (SuperNode a) -> Tree (SuperNode a)
- viableNode :: (Ord a, Ord b) => (b -> Bool) -> PropertyMap a b -> a -> Bool
- pinpointRecursion :: (Ord a, Ord b) => (b -> Bool) -> PropertyMap a b -> Tree (SuperNode a) -> Seq (Pinpoint a b)
- pinpoint :: (Ord a, Ord b) => Double -> Int -> (b -> Bool) -> PropertyMap a b -> Tree (SuperNode a) -> Seq (Pinpoint a b)
Documentation
getValidPropertyMap :: (Ord a, Ord b) => Tree (SuperNode a) -> PropertyMap a b -> PropertyMap a b Source
Filter the PropertyMap based on the tree, getting rid of extra vertices
rootSubtree :: Tree (SuperNode a) -> Tree (SuperNode a) Source
Convert a subtree first node to a root
viableNode :: (Ord a, Ord b) => (b -> Bool) -> PropertyMap a b -> a -> Bool Source
Check if a node belongs to a label
pinpointRecursion :: (Ord a, Ord b) => (b -> Bool) -> PropertyMap a b -> Tree (SuperNode a) -> Seq (Pinpoint a b) Source
Assign the clumpiness to each subtree and add them to a list. Ignore if the vertex is a root
pinpoint :: (Ord a, Ord b) => Double -> Int -> (b -> Bool) -> PropertyMap a b -> Tree (SuperNode a) -> Seq (Pinpoint a b) Source
Return the clumpiness vertices in the tree based on the minimum clumpiness and the minimum number of descendent leaves. Here, viable is the same usage as in Algorithms. The clumpiness values are only reported if they are above a threshold of minClumpiness.