Modulealgebraic-graphs-0.8Haskell2010

Algebra.Graph.Labelled.Example.Network

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
type JourneyTime
value eastCoast
value scotRail
value network

Packagealgebraic-graphs-0.8
Exports5
LanguageHaskell2010
LicenceMIT
SourceNetwork.hs

datadata City

Source#

Our example networks have cities as vertices.

Aberdeen Edinburgh Glasgow London Newcastle

Instances5Bounded, Enum, Eq, Ord, Show

Bounded CityDefined in algebraic-graphs-0.8 · Algebra.Graph.Labelled.Example.Network
Enum CityDefined in algebraic-graphs-0.8 · Algebra.Graph.Labelled.Example.Network
Eq CityDefined in algebraic-graphs-0.8 · Algebra.Graph.Labelled.Example.Network
Ord CityDefined in algebraic-graphs-0.8 · Algebra.Graph.Labelled.Example.Network
Show CityDefined in algebraic-graphs-0.8 · Algebra.Graph.Labelled.Example.Network

typetype JourneyTime = Int

Source#

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

valueeastCoast :: 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 ]

valuescotRail :: 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 ]

valuenetwork :: Network JourneyTime City

Source#

An example train network.

network = overlay scotRail eastCoast