| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
HGraph.Directed.PathAnonymity
Synopsis
- pathAnonymity :: (DirectedGraph t, Adjacency t, Ord b1, Num b1) => t b2 -> b1
- pathAnonymityCertificate :: (DirectedGraph t, Adjacency t, Ord b1, Num b1) => t b2 -> ([b2], b1)
- pathPathAnonymityI :: (Adjacency t, Ord a, Num p) => t a -> [a] -> p
Documentation
pathAnonymity :: (DirectedGraph t, Adjacency t, Ord b1, Num b1) => t b2 -> b1 Source #
pathAnonymityCertificate :: (DirectedGraph t, Adjacency t, Ord b1, Num b1) => t b2 -> ([b2], b1) Source #
Path anonymity of a digraph together with a path witnessing | that the anonymity is at least the returned value.