| Safe Haskell | None |
|---|---|
| Language | GHC2024 |
Proarrow.Profunctor.Instance.Edges
Description
Relations and weighted graphs on a bare set of points, given as a table: a list of edges with
their weights in the enriching category v. Edges is an enriched profunctor on the discrete
category of an Indexed kind (over a discrete base there is nothing to be compatible with), so
it composes, and its Kleene closure Closure is
reachability for BOOL weights and shortest paths for COST weights.
Synopsis
- data Edges (es :: [(k, k, v)]) (a :: DISCRETE k) (b :: DISCRETE k) where
- type family WeightOf (es :: [(k, k, v)]) (a :: DISCRETE k) (b :: DISCRETE k) :: v where ...
- type family EdgeSrc (e :: (k, k, v)) :: k where ...
- type family EdgeTgt (e :: (k, k, v)) :: k where ...
- type family EdgeWeight (e :: (k, k, v)) :: v where ...
- class (e ~ '(EdgeSrc e, EdgeTgt e, EdgeWeight e), KnownIndex (EdgeSrc e), KnownIndex (EdgeTgt e), Ob (EdgeWeight e)) => KnownEdge (e :: (k, k, v))
- type EdgeList = ListOf (KnownEdge :: (k, k, v) -> Constraint)
- type KnownEdges (es :: [(k, k, v)]) = KnownListOf (KnownEdge :: (k, k, v) -> Constraint) es
- lookupEdge :: forall {k} {v} (es :: [(k, k, v)]) (a :: DISCRETE k) (b :: DISCRETE k) r. (Indexed k, KnownIndex a, KnownIndex b) => EdgeList es -> (WeightOf es a b ~ (InitialObject :: v) => r) -> (forall (w :: v). (WeightOf es a b ~ w, Ob w) => r) -> r
- withObWeight :: forall {k} {v} (es :: [(k, k, v)]) (a :: DISCRETE k) (b :: DISCRETE k) r. (Quantale v, Indexed k, KnownEdges es, KnownIndex a, KnownIndex b) => (Ob (WeightOf es a b) => r) -> r
- enrichedEdge :: forall {k} {v} (es :: [(k, k, v)]) (a :: DISCRETE k) (b :: DISCRETE k). (Quantale v, Indexed k, KnownEdges es, KnownIndex a, KnownIndex b) => ((Unit :: v) ~> WeightOf es a b) -> Edges es a b
Documentation
data Edges (es :: [(k, k, v)]) (a :: DISCRETE k) (b :: DISCRETE k) where Source Github #
A weighted graph on the bare set of points of an Indexed kind, given as a list of edges with
their weights in v: an enriched profunctor on the discrete category, since over a discrete base
there is nothing to be compatible with. Unlisted pairs are at InitialObject, a pair listed twice
takes its first weight, and an element is a pair at Unit weight.
Constructors
| Edge :: forall {k} {v} (a :: DISCRETE k) (b :: DISCRETE k) (es :: [(k, k, v)]). (Ob a, Ob b, WeightOf es a b ~ (Unit :: v)) => Edges es a b |
Instances
| (Indexed k, KnownEdges es) => EnrichedProfunctor COST (Edges es :: DISCRETE k -> DISCRETE k -> Type) Source Github # | A graph with |
Defined in Proarrow.Profunctor.Instance.Edges Methods withProObj :: forall (a :: DISCRETE k) (b :: DISCRETE k) r. (Ob a, Ob b) => (Ob (ProObj COST (Edges es) a b) => r) -> r Source Github # underlying :: forall (a :: DISCRETE k) (b :: DISCRETE k). Edges es a b -> (Unit :: COST) ~> ProObj COST (Edges es) a b Source Github # enriched :: forall (a :: DISCRETE k) (b :: DISCRETE k). (Ob a, Ob b) => ((Unit :: COST) ~> ProObj COST (Edges es) a b) -> Edges es a b Source Github # rmap :: forall (a :: DISCRETE k) (b :: DISCRETE k) (c :: DISCRETE k). (Ob a, Ob b, Ob c) => (HomObj COST b c ** ProObj COST (Edges es) a b) ~> ProObj COST (Edges es) a c Source Github # lmap :: forall (a :: DISCRETE k) (b :: DISCRETE k) (c :: DISCRETE k). (Ob a, Ob b, Ob c) => (HomObj COST c a ** ProObj COST (Edges es) a b) ~> ProObj COST (Edges es) c b Source Github # | |
| (Indexed k, KnownEdges es) => DecidableProfunctor (Edges es :: DISCRETE k -> DISCRETE k -> Type) Source Github # | |
Defined in Proarrow.Profunctor.Instance.Edges | |
| (Indexed k, KnownEdges es) => ThinProfunctor (Edges es :: DISCRETE k -> DISCRETE k -> Type) Source Github # | A graph with |
Defined in Proarrow.Profunctor.Instance.Edges | |
| Indexed k => Profunctor (Edges es :: DISCRETE k -> DISCRETE k -> Type) Source Github # | |
Defined in Proarrow.Profunctor.Instance.Edges Methods dimap :: forall (c :: DISCRETE k) (a :: DISCRETE k) (b :: DISCRETE k) (d :: DISCRETE k). (c ~> a) -> (b ~> d) -> Edges es a b -> Edges es c d Source Github # lmap :: forall (c :: DISCRETE k) (a :: DISCRETE k) (b :: DISCRETE k). (c ~> a) -> Edges es a b -> Edges es c b Source Github # rmap :: forall (b :: DISCRETE k) (d :: DISCRETE k) (a :: DISCRETE k). (b ~> d) -> Edges es a b -> Edges es a d Source Github # (\\) :: forall (a :: DISCRETE k) (b :: DISCRETE k) r. ((Ob a, Ob b) => r) -> Edges es a b -> r Source Github # | |
| type ProObj COST (Edges es :: DISCRETE k -> DISCRETE k -> Type) (a :: DISCRETE k) (b :: DISCRETE k) Source Github # | |
| type HasArrow (Edges es :: DISCRETE k -> DISCRETE k -> Type) (a :: DISCRETE k) (b :: DISCRETE k) Source Github # | |
| type Holds (Edges es :: DISCRETE k -> DISCRETE k -> Type) (a :: DISCRETE k) (b :: DISCRETE k) Source Github # | |
type family WeightOf (es :: [(k, k, v)]) (a :: DISCRETE k) (b :: DISCRETE k) :: v where ... Source Github #
type family EdgeSrc (e :: (k, k, v)) :: k where ... Source Github #
The source of an edge.
Equations
| EdgeSrc ('(x, y, w) :: (k, k, v)) = x |
type family EdgeTgt (e :: (k, k, v)) :: k where ... Source Github #
The target of an edge.
Equations
| EdgeTgt ('(x, y, w) :: (k, k, v)) = y |
type family EdgeWeight (e :: (k, k, v)) :: v where ... Source Github #
The weight of an edge.
Equations
| EdgeWeight ('(x, y, w) :: (k, k, v)) = w |
class (e ~ '(EdgeSrc e, EdgeTgt e, EdgeWeight e), KnownIndex (EdgeSrc e), KnownIndex (EdgeTgt e), Ob (EdgeWeight e)) => KnownEdge (e :: (k, k, v)) Source Github #
An edge whose endpoints are known and whose weight is an object.
Instances
| (e ~ '(EdgeSrc e, EdgeTgt e, EdgeWeight e), KnownIndex (EdgeSrc e), KnownIndex (EdgeTgt e), Ob (EdgeWeight e)) => KnownEdge (e :: (k, k, v)) Source Github # | |
Defined in Proarrow.Profunctor.Instance.Edges | |
type EdgeList = ListOf (KnownEdge :: (k, k, v) -> Constraint) Source Github #
The edge list, reflected to the value level.
type KnownEdges (es :: [(k, k, v)]) = KnownListOf (KnownEdge :: (k, k, v) -> Constraint) es Source Github #
lookupEdge :: forall {k} {v} (es :: [(k, k, v)]) (a :: DISCRETE k) (b :: DISCRETE k) r. (Indexed k, KnownIndex a, KnownIndex b) => EdgeList es -> (WeightOf es a b ~ (InitialObject :: v) => r) -> (forall (w :: v). (WeightOf es a b ~ w, Ob w) => r) -> r Source Github #
The weight of a pair, found by walking the edge list: the first continuation when the pair is not listed, the second with the weight when it is.
withObWeight :: forall {k} {v} (es :: [(k, k, v)]) (a :: DISCRETE k) (b :: DISCRETE k) r. (Quantale v, Indexed k, KnownEdges es, KnownIndex a, KnownIndex b) => (Ob (WeightOf es a b) => r) -> r Source Github #
The weight of a pair, reflected to the value level by walking the edge list.
enrichedEdge :: forall {k} {v} (es :: [(k, k, v)]) (a :: DISCRETE k) (b :: DISCRETE k). (Quantale v, Indexed k, KnownEdges es, KnownIndex a, KnownIndex b) => ((Unit :: v) ~> WeightOf es a b) -> Edges es a b Source Github #
A unit into a weight is an edge at the unit, since an object above the unit is the unit.