Data.Graph.Inductive.Graph

# General Type Defintions

## Node and Edge Types

type Node

type LNode a

type UNode

type Edge

type LEdge b

type UEdge

## Types Supporting Inductive Graph View

type Adj b

type Context a b

type MContext a b

type Decomp g a b

type GDecomp g a b

type UContext

type UDecomp g

type Path

data LPath a

type UPath

# Graph Type Classes

class Graph gr

class DynGraph gr

# Operations

## Graph Folds and Maps

ufold

gmap

nmap

emap

nemap

## Graph Projection

nodes

edges

toEdge

edgeLabel

toLEdge

newNodes

gelem

## Graph Construction and Destruction

insNode

insEdge

delNode

delEdge

delLEdge

delAllLEdge

insNodes

insEdges

delNodes

delEdges

buildGr

mkUGraph

## Subgraphs

gfiltermap

nfilter

labnfilter

labfilter

subgraph

## Graph Inspection

context

lab

neighbors

lneighbors

suc

pre

lsuc

lpre

out

inn

outdeg

indeg

deg

hasEdge

hasNeighbor

hasLEdge

hasNeighborAdj

equal

## Context Inspection

node'

lab'

labNode'

neighbors'

lneighbors'

suc'

pre'

lpre'

lsuc'

out'

inn'

outdeg'

indeg'

deg'

# Pretty-printing

prettify

prettyPrint

# Ordering of Graphs

data OrdGr gr a b