Data.Graph.Types

Documentation

newtype Graph g e v

Constructors

Graph

Fields

• getGraphInternal :: SomeGraph e v

Instances

Functor (Graph g e)

Methods

fmap :: (a -> b) -> Graph g e a -> Graph g e b

(<$) :: a -> Graph g e b -> Graph g e a

data SomeGraph e v

The neighbor vertices and neighbor edges must have equal length.

TODO: enforce that the inner vectors for the neighbors are ordered. This will make testing for neighbors easier and will make an equality check easier.

Constructors

SomeGraph

Fields

• graphVertices :: !(Vector v)
• graphOutboundNeighborVertices :: !(Vector (Vector Int))
• graphOutboundNeighborEdges :: !(Vector (Vector e))

Instances

Functor (SomeGraph e)

Methods

fmap :: (a -> b) -> SomeGraph e a -> SomeGraph e b

(<$) :: a -> SomeGraph e b -> SomeGraph e a

newtype Size g

Constructors

Size

Fields

• getSizeInternal :: Int

newtype Vertex g

Constructors

Vertex

Fields

• getVertexInternal :: Int

Instances

Eq (Vertex g)

Methods

(==) :: Vertex g -> Vertex g -> Bool

(/=) :: Vertex g -> Vertex g -> Bool

Ord (Vertex g)

Methods

compare :: Vertex g -> Vertex g -> Ordering

(<) :: Vertex g -> Vertex g -> Bool

(<=) :: Vertex g -> Vertex g -> Bool

(>) :: Vertex g -> Vertex g -> Bool

(>=) :: Vertex g -> Vertex g -> Bool

max :: Vertex g -> Vertex g -> Vertex g

min :: Vertex g -> Vertex g -> Vertex g

Hashable (Vertex g)

Methods

hashWithSalt :: Int -> Vertex g -> Int

hash :: Vertex g -> Int

newtype Vertices g v

Constructors

Vertices

Fields

• getVerticesInternal :: Vector v

Instances

Functor (Vertices g)

Methods

fmap :: (a -> b) -> Vertices g a -> Vertices g b

(<$) :: a -> Vertices g b -> Vertices g a

newtype MVertices g s v

Constructors

MVertices

Fields

• getMVerticesInternal :: MVector s v

newtype MUVertices g s v

Constructors

MUVertices

Fields

• getMUVerticesInternal :: MVector s v

data IntPair

Constructors

IntPair !Int !Int

Instances

Eq IntPair

Methods

(==) :: IntPair -> IntPair -> Bool

(/=) :: IntPair -> IntPair -> Bool

Ord IntPair

Methods

compare :: IntPair -> IntPair -> Ordering

(<) :: IntPair -> IntPair -> Bool

(<=) :: IntPair -> IntPair -> Bool

(>) :: IntPair -> IntPair -> Bool

(>=) :: IntPair -> IntPair -> Bool

max :: IntPair -> IntPair -> IntPair

min :: IntPair -> IntPair -> IntPair

Read IntPair

Methods

readsPrec :: Int -> ReadS IntPair

readList :: ReadS [IntPair]

readPrec :: ReadPrec IntPair

readListPrec :: ReadPrec [IntPair]

Show IntPair

Methods

showsPrec :: Int -> IntPair -> ShowS

show :: IntPair -> String

showList :: [IntPair] -> ShowS

Generic IntPair

Associated Types

type Rep IntPair :: * -> *

Methods

from :: IntPair -> Rep IntPair x

to :: Rep IntPair x -> IntPair

Hashable IntPair

Methods

hashWithSalt :: Int -> IntPair -> Int

hash :: IntPair -> Int

type Rep IntPair

type Rep IntPair = D1 (MetaData "IntPair" "Data.Graph.Types" "impure-containers-0.2-1gmaUklLkY084J1mx4qHWd" False) (C1 (MetaCons "IntPair" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedUnpack) (Rec0 Int)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedUnpack) (Rec0 Int))))

data MGraph g s e v

Constructors

MGraph

Fields

• mgraphVertexIndex :: !(HashTable s v Int)
• mgraphCurrentId :: !(MutVar s Int)
• mgraphEdges :: !(HashTable s IntPair e)