gogl

package module

Go to main page

Versions in this module

v0

v0.4.0

Aug 1, 2014

Changes in this version

+ const G_BASIC

+ const G_DATA

+ const G_DIRECTED

+ const G_IMMUTABLE

+ const G_LABELED

+ const G_LOOPS

+ const G_MUTABLE

+ const G_PARALLEL

+ const G_PERSISTENT

+ const G_SIMPLE

+ const G_UNDIRECTED

+ const G_WEIGHTED

+ const NullGraph

+ func CopyGraph(from Graph, to interface{}) interface

+ type AdjacencyEnumerator interface

+ EachAdjacentTo func(start Vertex, adjacentVertexLambda VertexLambda)

type DataEdge

+ func NewDataEdge(u, v Vertex, data interface{}) DataEdge

+ type DataEdgeList []DataEdge

+ func (el DataEdgeList) EachEdge(fn EdgeLambda)

+ func (el DataEdgeList) EachVertex(fn VertexLambda)

+ func (el DataEdgeList) Order() int

+ type DataEdgeSetMutator interface

+ AddEdges func(edges ...DataEdge)

+ RemoveEdges func(edges ...DataEdge)

+ type DegreeChecker interface

+ DegreeOf func(Vertex) (degree int, exists bool)

+ type Digraph interface

+ type DirectedDegreeChecker interface

+ InDegreeOf func(Vertex) (degree int, exists bool)

+ OutDegreeOf func(Vertex) (degree int, exists bool)

type Edge

+ func CollectArcsFrom(v Vertex, g IncidentArcEnumerator) (edges []Edge)

+ func CollectArcsTo(v Vertex, g IncidentArcEnumerator) (edges []Edge)

+ func CollectEdges(g EdgeEnumerator) (edges []Edge)

+ func CollectEdgesIncidentTo(v Vertex, g IncidentEdgeEnumerator) (edges []Edge)

+ func NewEdge(u, v Vertex) Edge

+ type EdgeEnumerator interface

+ EachEdge func(EdgeLambda)

+ type EdgeLambda func(Edge) (terminate bool)

type EdgeList

+ func (el EdgeList) EachEdge(fn EdgeLambda)

+ func (el EdgeList) EachVertex(fn VertexLambda)

+ func (el EdgeList) Order() int

+ type EdgeMembershipChecker interface

+ HasEdge func(Edge) bool

+ type EdgeSetMutator interface

+ AddEdges func(edges ...Edge)

+ RemoveEdges func(edges ...Edge)

type Graph

+ func AdjacencyList(gs GraphSpec) Graph

+ type GraphProperties uint16

+ type GraphSource interface

+ Order func() int

+ type GraphSpec struct

+ Props GraphProperties

+ Source GraphSource

+ func G() GraphSpec

+ func (b GraphSpec) Basic() GraphSpec

+ func (b GraphSpec) Create(f func(GraphSpec) Graph) Graph

+ func (b GraphSpec) DataEdges() GraphSpec

+ func (b GraphSpec) Directed() GraphSpec

+ func (b GraphSpec) Immutable() GraphSpec

+ func (b GraphSpec) Labeled() GraphSpec

+ func (b GraphSpec) Loop() GraphSpec

+ func (b GraphSpec) MultiGraph() GraphSpec

+ func (b GraphSpec) Mutable() GraphSpec

+ func (b GraphSpec) Parallel() GraphSpec

+ func (b GraphSpec) PseudoGraph() GraphSpec

+ func (b GraphSpec) SimpleGraph() GraphSpec

+ func (b GraphSpec) Undirected() GraphSpec

+ func (b GraphSpec) Using(g GraphSource) GraphSpec

+ func (b GraphSpec) Weighted() GraphSpec

+ type IncidentArcEnumerator interface

+ EachArcFrom func(v Vertex, outEdgeLambda EdgeLambda)

+ EachArcTo func(v Vertex, inEdgeLambda EdgeLambda)

+ type IncidentEdgeEnumerator interface

+ EachEdgeIncidentTo func(v Vertex, incidentEdgeLambda EdgeLambda)

type LabeledEdge

+ func NewLabeledEdge(u, v Vertex, label string) LabeledEdge

+ type LabeledEdgeList []LabeledEdge

+ func (el LabeledEdgeList) EachEdge(fn EdgeLambda)

+ func (el LabeledEdgeList) EachVertex(fn VertexLambda)

+ func (el LabeledEdgeList) Order() int

+ type LabeledEdgeSetMutator interface

+ AddEdges func(edges ...LabeledEdge)

+ RemoveEdges func(edges ...LabeledEdge)

+ type Transposer interface

+ Transpose func() Digraph

type Vertex

+ func CollectVertices(g VertexEnumerator) (vertices []Vertex)

+ func CollectVerticesAdjacentTo(v Vertex, g AdjacencyEnumerator) (vertices []Vertex)

+ type VertexEnumerator interface

+ EachVertex func(VertexLambda)

+ type VertexLambda func(Vertex) (terminate bool)

+ type VertexMembershipChecker interface

+ HasVertex func(Vertex) bool

+ type VertexSetMutator interface

+ EnsureVertex func(...Vertex)

+ RemoveVertex func(...Vertex)

type WeightedEdge

+ func NewWeightedEdge(u, v Vertex, weight float64) WeightedEdge

+ type WeightedEdgeList []WeightedEdge

+ func (el WeightedEdgeList) EachEdge(fn EdgeLambda)

+ func (el WeightedEdgeList) EachVertex(fn VertexLambda)

+ func (el WeightedEdgeList) Order() int

+ type WeightedEdgeSetMutator interface

+ AddEdges func(edges ...WeightedEdge)

+ RemoveEdges func(edges ...WeightedEdge)

v0.3.0

Apr 14, 2014

Changes in this version

+ type BaseDataEdge struct

+ D interface{}

+ func (e BaseDataEdge) Data() interface{}

+ type DataEdge interface

+ Data func() interface{}

+ type DataGraph interface

+ EachDataEdge func(f func(edge DataEdge))

+ HasDataEdge func(e DataEdge) bool

+ type MutableDataGraph interface

+ AddEdges func(edges ...DataEdge)

+ EnsureVertex func(vertices ...Vertex)

+ RemoveEdges func(edges ...DataEdge)

+ RemoveVertex func(vertices ...Vertex)

+ func NewDataDirected() MutableDataGraph

+ func NewDataUndirected() MutableDataGraph

v0.2.0

Apr 14, 2014

Changes in this version

+ var Graphs = make(map[string]GraphFactory, 0)

+ func New(name string) (graph interface{}, err error)

+ func RegisterGraph(name string, factory GraphFactory) error

+ type BaseLabeledEdge struct

+ L string

+ func (e BaseLabeledEdge) Label() string

+ type GraphFactory func() interface

+ type LabeledEdge interface

+ Label func() string

+ type LabeledGraph interface

+ EachLabeledEdge func(f func(edge LabeledEdge))

+ HasLabeledEdge func(e LabeledEdge) bool

+ type MutableLabeledGraph interface

+ AddEdges func(edges ...LabeledEdge)

+ EnsureVertex func(vertices ...Vertex)

+ RemoveEdges func(edges ...LabeledEdge)

+ RemoveVertex func(vertices ...Vertex)

+ func NewLabeledDirected() MutableLabeledGraph

+ func NewLabeledUndirected() MutableLabeledGraph

v0.1.0

Apr 3, 2014

Changes in this version

type BaseEdge

+ U Vertex

+ V Vertex

+ type BaseWeightedEdge struct

+ W int

+ func (e BaseWeightedEdge) Weight() int

+ type Directed struct

+ func NewDirected() *Directed

+ func (g *Directed) AddEdges(edges ...Edge)

+ func (g *Directed) Density() float64

+ func (g *Directed) EachAdjacent(vertex Vertex, f func(target Vertex))

+ func (g *Directed) EachEdge(f func(edge Edge))

+ func (g *Directed) EachVertex(f func(vertex Vertex))

+ func (g *Directed) EnsureVertex(vertices ...Vertex)

+ func (g *Directed) HasEdge(edge Edge) bool

+ func (g *Directed) HasVertex(vertex Vertex) (exists bool)

+ func (g *Directed) InDegree(vertex Vertex) (degree int, exists bool)

+ func (g *Directed) Order() int

+ func (g *Directed) OutDegree(vertex Vertex) (degree int, exists bool)

+ func (g *Directed) RemoveEdges(edges ...Edge)

+ func (g *Directed) RemoveVertex(vertices ...Vertex)

+ func (g *Directed) Size() int

+ func (g *Directed) Transpose() DirectedGraph

type Graph

+ HasEdge func(e Edge) bool

+ type MutableGraph interface

+ AddEdges func(edges ...Edge)

+ EnsureVertex func(vertices ...Vertex)

+ RemoveEdges func(edges ...Edge)

+ RemoveVertex func(vertices ...Vertex)

+ type MutableWeightedGraph interface

+ AddEdges func(edges ...WeightedEdge)

+ EnsureVertex func(vertices ...Vertex)

+ RemoveEdges func(edges ...WeightedEdge)

+ RemoveVertex func(vertices ...Vertex)

+ func NewWeightedDirected() MutableWeightedGraph

+ func NewWeightedUndirected() MutableWeightedGraph

+ type Undirected struct

+ func NewUndirected() *Undirected

+ func (g *Undirected) AddEdges(edges ...Edge)

+ func (g *Undirected) Density() float64

+ func (g *Undirected) EachAdjacent(vertex Vertex, f func(target Vertex))

+ func (g *Undirected) EachEdge(f func(edge Edge))

+ func (g *Undirected) EachVertex(f func(vertex Vertex))

+ func (g *Undirected) EnsureVertex(vertices ...Vertex)

+ func (g *Undirected) HasEdge(edge Edge) bool

+ func (g *Undirected) HasVertex(vertex Vertex) (exists bool)

+ func (g *Undirected) InDegree(vertex Vertex) (degree int, exists bool)

+ func (g *Undirected) Order() int

+ func (g *Undirected) OutDegree(vertex Vertex) (degree int, exists bool)

+ func (g *Undirected) RemoveEdges(edges ...Edge)

+ func (g *Undirected) RemoveVertex(vertices ...Vertex)

+ func (g *Undirected) Size() int

+ type WeightedEdge interface

+ Weight func() int

+ type WeightedGraph interface

+ EachWeightedEdge func(f func(edge WeightedEdge))

+ HasWeightedEdge func(e WeightedEdge) bool

v0.0.1

Jan 20, 2014

Changes in this version

+ const EM_DIRECTED

+ const EM_LOOPS

+ const EM_MULTIGRAPH

+ const EM_SIGNED

+ const EM_TYPED

+ const EM_UNDIRECTED

+ const EM_WEIGHTED

+ const E_DIRECTED

+ const E_LOOPS

+ const E_MULTIGRAPH

+ const E_SIGNED

+ const E_TYPED

+ const E_UNDIRECTED

+ const E_WEIGHTED

+ func DepthFirstFromVertices(g Graph, vis DFVisitor, vertices ...Vertex) error

+ type BaseEdge struct

+ func (e BaseEdge) Both() (Vertex, Vertex)

+ func (e BaseEdge) Source() Vertex

+ func (e BaseEdge) Target() Vertex

+ type DFTslVisitor struct

+ func (vis *DFTslVisitor) GetTsl() []Vertex

+ type DFVisitor interface

+ type DirectedAdjacencyList struct

+ func NewDirectedAdjacencyList() *DirectedAdjacencyList

+ func NewDirectedAdjacencyListFromEdgeSet(set []Edge) *DirectedAdjacencyList

+ func (g *DirectedAdjacencyList) AddEdge(edge Edge) bool

+ func (g *DirectedAdjacencyList) Density() float64

+ func (g *DirectedAdjacencyList) EachAdjacent(vertex Vertex, f func(target Vertex))

+ func (g *DirectedAdjacencyList) EachEdge(f func(edge Edge))

+ func (g *DirectedAdjacencyList) EachVertex(f func(vertex Vertex))

+ func (g *DirectedAdjacencyList) EnsureVertex(vertices ...Vertex)

+ func (g *DirectedAdjacencyList) HasVertex(vertex Vertex) (exists bool)

+ func (g *DirectedAdjacencyList) InDegree(vertex Vertex) (degree int, exists bool)

+ func (g *DirectedAdjacencyList) Order() int

+ func (g *DirectedAdjacencyList) OutDegree(vertex Vertex) (degree int, exists bool)

+ func (g *DirectedAdjacencyList) RemoveEdge(edge Edge)

+ func (g *DirectedAdjacencyList) RemoveVertex(vertices ...Vertex)

+ func (g *DirectedAdjacencyList) Size() int

+ type DirectedGraph interface

+ GetCycles func() [][]Vertex

+ IsAcyclic func() bool

+ Transpose func() DirectedGraph

+ type Edge interface

+ Both func() (Vertex, Vertex)

+ Source func() Vertex

+ Target func() Vertex

+ type EdgeFilterer interface

+ FilterEdge func(edge Edge) bool

+ FilterEdges func(edges []Edge) []Edge

+ type EdgeList []Edge

+ type Graph interface

+ EachAdjacent func(vertex Vertex, f func(adjacent Vertex))

+ EachEdge func(f func(edge Edge))

+ EachVertex func(f func(vertex Vertex))

+ EnsureVertex func(vertices ...Vertex)

+ HasVertex func(vertex Vertex) bool

+ InDegree func(vertex Vertex) (int, bool)

+ Order func() int

+ OutDegree func(vertex Vertex) (int, bool)

+ RemoveVertex func(vertices ...Vertex)

+ Size func() int

+ type IdentifiableVertex interface

+ type Path []Edge

+ type SimpleGraph interface

+ Density func() float64

+ type UndirectedGraph interface

+ AddEdge func(edge Edge) bool

+ RemoveEdge func(edge Edge)

+ type Vertex interface

+ type VertexList []Vertex

+ type VertexSet map[Vertex]struct

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL