Contents
Index
planar-graph-1.0.0.0: A representation of planar graphs
Index
addEdge
Data.Graph.Planar
addEdgeUndirected
Data.Graph.Planar
addNode
Data.Graph.Planar
addUEdge
Data.Graph.Planar
addUNode
Data.Graph.Planar
adjoiningFaces
Data.Graph.Planar
adjustEdgeLabel
Data.Graph.Planar
adjustNodeLabel
Data.Graph.Planar
AfterEdge
Data.Graph.Planar
antiClockwiseTraversal
Data.Graph.Planar
anyMissing
Data.Graph.Planar
Anywhere
Data.Graph.Planar
AsciiCode
1 (Type/Class)
Data.Graph.Planar.Serialisation.AsciiCode
2 (Data Constructor)
Data.Graph.Planar.Serialisation.AsciiCode
BeforeEdge
Data.Graph.Planar
breadthFirst
Data.Graph.Planar
canonicalExampleBy
Data.Graph.Planar
connectedComponents
Data.Graph.Planar
contractEdge
Data.Graph.Planar
decodePlanarFile
Data.Graph.Planar.Serialisation
deleteEdge
Data.Graph.Planar
deleteNode
Data.Graph.Planar
depthFirst
Data.Graph.Planar
deserialise
Data.Graph.Planar
Edge
Data.Graph.Planar
edgeCrossings
Data.Graph.Planar
edgeLabel
Data.Graph.Planar
EdgePos
Data.Graph.Planar
edges
Data.Graph.Planar
edgesBetween
Data.Graph.Planar
ELabel
Data.Graph.Planar.Serialisation
empty
Data.Graph.Planar
encodePlanarFile
Data.Graph.Planar.Serialisation
encodePlanarFileFrom
Data.Graph.Planar.Serialisation
Face
Data.Graph.Planar
faceEdges
Data.Graph.Planar
FaceInfo
Data.Graph.Planar
FaceMap
Data.Graph.Planar
faceNodes
Data.Graph.Planar
fromNode
Data.Graph.Planar
getFace
Data.Graph.Planar
getFaces
Data.Graph.Planar
getName
Data.Graph.Planar.Serialisation
getSG
Data.Graph.Planar.Serialisation
GraphTraversal
Data.Graph.Planar
halfEdges
Data.Graph.Planar
halfEdgesBetween
Data.Graph.Planar
hasEdge
Data.Graph.Planar
hasNode
Data.Graph.Planar
incomingEdges
Data.Graph.Planar
inverseEdge
Data.Graph.Planar
isEmpty
Data.Graph.Planar
labEdges
Data.Graph.Planar
labEdgesBetween
Data.Graph.Planar
labHalfEdges
Data.Graph.Planar
labHalfEdgesBetween
Data.Graph.Planar
labNodes
Data.Graph.Planar
makeDual
Data.Graph.Planar
mapEdges
Data.Graph.Planar
mapNodes
Data.Graph.Planar
mergeAllGraphs
Data.Graph.Planar
mergeGraphs
Data.Graph.Planar
mergeGraphTraversals
Data.Graph.Planar
neighbours
Data.Graph.Planar
nextEdge
Data.Graph.Planar
NLabel
Data.Graph.Planar.Serialisation
Node
Data.Graph.Planar
nodeLabel
Data.Graph.Planar
nodes
Data.Graph.Planar
onlyCanonicalExamples
Data.Graph.Planar
order
Data.Graph.Planar
outgoingEdges
Data.Graph.Planar
PlanarCode
1 (Type/Class)
Data.Graph.Planar.Serialisation.PlanarCode
2 (Data Constructor)
Data.Graph.Planar.Serialisation.PlanarCode
PlanarEncoding
Data.Graph.Planar.Serialisation
PlanarGraph
Data.Graph.Planar
prettify
Data.Graph.Planar
prettyPrint
Data.Graph.Planar
prevEdge
Data.Graph.Planar
putName
Data.Graph.Planar.Serialisation
putSG
Data.Graph.Planar.Serialisation
renumber
Data.Graph.Planar
sepByNewline
Data.Graph.Planar.Serialisation
serialise
Data.Graph.Planar
serialiseBFS
Data.Graph.Planar
SerialisedGraph
Data.Graph.Planar
serialTraversal
Data.Graph.Planar
setEdgeLabel
Data.Graph.Planar
setNodeLabel
Data.Graph.Planar
size
Data.Graph.Planar
spanningTraversal
Data.Graph.Planar
toDual
Data.Graph.Planar
toNode
Data.Graph.Planar
Traversal
Data.Graph.Planar
traverse
Data.Graph.Planar
traversed
Data.Graph.Planar
TraversedValues
Data.Graph.Planar
unlabel
Data.Graph.Planar
visited
Data.Graph.Planar