Copyright	(c) Andrey Mokhov 2016-2022
License	MIT (see the file LICENSE)
Maintainer	[email protected]
Stability	experimental
Safe Haskell	Safe-Inferred
Language	Haskell2010

Algebra.Graph.Labelled.Example.Network

Description

Alga is a library for algebraic construction and manipulation of graphs in Haskell. See this paper for the motivation behind the library, the underlying theory, and implementation details.

This module contains a simple example of using edge-labelled graphs defined in the module Algebra.Graph.Labelled for working with networks, i.e. graphs whose edges are labelled with distances.

Synopsis

data City
- = Aberdeen
- | Edinburgh
- | Glasgow
- | London
- | Newcastle
type JourneyTime = Int
eastCoast :: Network JourneyTime City
scotRail :: Network JourneyTime City
network :: Network JourneyTime City

Documentation

data City Source #

Our example networks have cities as vertices.

Constructors

Aberdeen
Edinburgh
Glasgow
London
Newcastle

Instances

Instances details

Bounded City Source #
Instance details Defined in Algebra.Graph.Labelled.Example.Network Methods minBound :: City Source # maxBound :: City Source #
Enum City Source #
Instance details Defined in Algebra.Graph.Labelled.Example.Network Methods succ :: City -> City Source # pred :: City -> City Source # toEnum :: Int -> City Source # fromEnum :: City -> Int Source # enumFrom :: City -> [City] Source # enumFromThen :: City -> City -> [City] Source # enumFromTo :: City -> City -> [City] Source # enumFromThenTo :: City -> City -> City -> [City] Source #
Show City Source #
Instance details Defined in Algebra.Graph.Labelled.Example.Network Methods showsPrec :: Int -> City -> ShowS Source # show :: City -> String Source # showList :: [City] -> ShowS Source #
Eq City Source #
Instance details Defined in Algebra.Graph.Labelled.Example.Network Methods (==) :: City -> City -> Bool Source # (/=) :: City -> City -> Bool Source #
Ord City Source #
Instance details Defined in Algebra.Graph.Labelled.Example.Network Methods compare :: City -> City -> Ordering Source # (<) :: City -> City -> Bool Source # (<=) :: City -> City -> Bool Source # (>) :: City -> City -> Bool Source # (>=) :: City -> City -> Bool Source # max :: City -> City -> City Source # min :: City -> City -> City Source #

type JourneyTime = Int Source #

For simplicity we measure journey times in integer number of minutes.

eastCoast :: Network JourneyTime City Source #

A part of the EastCoast train network between Aberdeen and London.

eastCoast = overlays [ Aberdeen  -<150>- Edinburgh
                     , Edinburgh -< 90>- Newcastle
                     , Newcastle -<170>- London ]

scotRail :: Network JourneyTime City Source #

A part of the ScotRail train network between Aberdeen and Glasgow.

scotRail = overlays [ Aberdeen  -<140>- Edinburgh
                    , Edinburgh -< 50>- Glasgow
                    , Edinburgh -< 70>- Glasgow ]

network :: Network JourneyTime City Source #

An example train network.

network = overlay scotRail eastCoast