hgraph-1.10.0.0: Tools for working on (di)graphs.
Safe HaskellSafe-Inferred
LanguageHaskell2010

HGraph.Directed.PathAnonymity

Synopsis

Documentation

pathAnonymity :: (Adjacency t, Ord b, Num b, DirectedGraph t) => t b -> b Source #

pathAnonymityCertificate :: (Adjacency t, Ord b, Num b, DirectedGraph t) => t b -> ([b], b) Source #

Path anonymity of a digraph together with a path witnessing | that the anonymity is at least the returned value.

pathPathAnonymityI :: (Adjacency t, Ord a, Num a) => t a -> [a] -> a Source #

Path anonymity of a maximal path. | The path provided is assumed to be maximal.