Versions in this module Expand all Collapse all v0 v0.9.2 May 11, 2021 Changes in this version + type DirectedGraph struct + func NewDirectedGraph() *DirectedGraph + func (g *DirectedGraph) AddNode(n graph.Node) + func (g *DirectedGraph) Edge(uid, vid int64) graph.Edge + func (g *DirectedGraph) Edges() graph.Edges + func (g *DirectedGraph) From(id int64) graph.Nodes + func (g *DirectedGraph) HasEdgeBetween(xid, yid int64) bool + func (g *DirectedGraph) HasEdgeFromTo(uid, vid int64) bool + func (g *DirectedGraph) Lines(uid, vid int64) graph.Lines + func (g *DirectedGraph) NewLine(from, to graph.Node) graph.Line + func (g *DirectedGraph) NewNode() graph.Node + func (g *DirectedGraph) Node(id int64) graph.Node + func (g *DirectedGraph) NodeWithID(id int64) (n graph.Node, new bool) + func (g *DirectedGraph) Nodes() graph.Nodes + func (g *DirectedGraph) RemoveLine(fid, tid, id int64) + func (g *DirectedGraph) RemoveNode(id int64) + func (g *DirectedGraph) SetLine(l graph.Line) + func (g *DirectedGraph) To(id int64) graph.Nodes + type Edge struct + F graph.Node + T graph.Node + func (e Edge) From() graph.Node + func (e Edge) ReversedEdge() graph.Edge + func (e Edge) To() graph.Node + type Line struct + F graph.Node + T graph.Node + UID int64 + func (l Line) From() graph.Node + func (l Line) ID() int64 + func (l Line) ReversedLine() graph.Line + func (l Line) To() graph.Node + type Node int64 + func (n Node) ID() int64 + type UndirectedGraph struct + func NewUndirectedGraph() *UndirectedGraph + func (g *UndirectedGraph) AddNode(n graph.Node) + func (g *UndirectedGraph) Edge(uid, vid int64) graph.Edge + func (g *UndirectedGraph) EdgeBetween(xid, yid int64) graph.Edge + func (g *UndirectedGraph) Edges() graph.Edges + func (g *UndirectedGraph) From(id int64) graph.Nodes + func (g *UndirectedGraph) HasEdgeBetween(xid, yid int64) bool + func (g *UndirectedGraph) Lines(uid, vid int64) graph.Lines + func (g *UndirectedGraph) LinesBetween(xid, yid int64) graph.Lines + func (g *UndirectedGraph) NewLine(from, to graph.Node) graph.Line + func (g *UndirectedGraph) NewNode() graph.Node + func (g *UndirectedGraph) Node(id int64) graph.Node + func (g *UndirectedGraph) NodeWithID(id int64) (n graph.Node, new bool) + func (g *UndirectedGraph) Nodes() graph.Nodes + func (g *UndirectedGraph) RemoveLine(fid, tid, id int64) + func (g *UndirectedGraph) RemoveNode(id int64) + func (g *UndirectedGraph) SetLine(l graph.Line) + type WeightedDirectedGraph struct + EdgeWeightFunc func(graph.WeightedLines) float64 + func NewWeightedDirectedGraph() *WeightedDirectedGraph + func (g *WeightedDirectedGraph) AddNode(n graph.Node) + func (g *WeightedDirectedGraph) Edge(uid, vid int64) graph.Edge + func (g *WeightedDirectedGraph) Edges() graph.Edges + func (g *WeightedDirectedGraph) From(id int64) graph.Nodes + func (g *WeightedDirectedGraph) HasEdgeBetween(xid, yid int64) bool + func (g *WeightedDirectedGraph) HasEdgeFromTo(uid, vid int64) bool + func (g *WeightedDirectedGraph) Lines(uid, vid int64) graph.Lines + func (g *WeightedDirectedGraph) NewNode() graph.Node + func (g *WeightedDirectedGraph) NewWeightedLine(from, to graph.Node, weight float64) graph.WeightedLine + func (g *WeightedDirectedGraph) Node(id int64) graph.Node + func (g *WeightedDirectedGraph) NodeWithID(id int64) (n graph.Node, new bool) + func (g *WeightedDirectedGraph) Nodes() graph.Nodes + func (g *WeightedDirectedGraph) RemoveLine(fid, tid, id int64) + func (g *WeightedDirectedGraph) RemoveNode(id int64) + func (g *WeightedDirectedGraph) SetWeightedLine(l graph.WeightedLine) + func (g *WeightedDirectedGraph) To(id int64) graph.Nodes + func (g *WeightedDirectedGraph) Weight(uid, vid int64) (w float64, ok bool) + func (g *WeightedDirectedGraph) WeightedEdge(uid, vid int64) graph.WeightedEdge + func (g *WeightedDirectedGraph) WeightedEdges() graph.WeightedEdges + func (g *WeightedDirectedGraph) WeightedLines(uid, vid int64) graph.WeightedLines + type WeightedEdge struct + F graph.Node + T graph.Node + WeightFunc func(graph.WeightedLines) float64 + func (e WeightedEdge) From() graph.Node + func (e WeightedEdge) ReversedEdge() graph.Edge + func (e WeightedEdge) To() graph.Node + func (e WeightedEdge) Weight() float64 + type WeightedLine struct + F graph.Node + T graph.Node + UID int64 + W float64 + func (l WeightedLine) From() graph.Node + func (l WeightedLine) ID() int64 + func (l WeightedLine) ReversedLine() graph.Line + func (l WeightedLine) To() graph.Node + func (l WeightedLine) Weight() float64 + type WeightedUndirectedGraph struct + EdgeWeightFunc func(graph.WeightedLines) float64 + func NewWeightedUndirectedGraph() *WeightedUndirectedGraph + func (g *WeightedUndirectedGraph) AddNode(n graph.Node) + func (g *WeightedUndirectedGraph) Edge(uid, vid int64) graph.Edge + func (g *WeightedUndirectedGraph) EdgeBetween(xid, yid int64) graph.Edge + func (g *WeightedUndirectedGraph) Edges() graph.Edges + func (g *WeightedUndirectedGraph) From(id int64) graph.Nodes + func (g *WeightedUndirectedGraph) HasEdgeBetween(xid, yid int64) bool + func (g *WeightedUndirectedGraph) Lines(uid, vid int64) graph.Lines + func (g *WeightedUndirectedGraph) LinesBetween(xid, yid int64) graph.Lines + func (g *WeightedUndirectedGraph) NewNode() graph.Node + func (g *WeightedUndirectedGraph) NewWeightedLine(from, to graph.Node, weight float64) graph.WeightedLine + func (g *WeightedUndirectedGraph) Node(id int64) graph.Node + func (g *WeightedUndirectedGraph) NodeWithID(id int64) (n graph.Node, new bool) + func (g *WeightedUndirectedGraph) Nodes() graph.Nodes + func (g *WeightedUndirectedGraph) RemoveLine(fid, tid, id int64) + func (g *WeightedUndirectedGraph) RemoveNode(id int64) + func (g *WeightedUndirectedGraph) SetWeightedLine(l graph.WeightedLine) + func (g *WeightedUndirectedGraph) Weight(xid, yid int64) (w float64, ok bool) + func (g *WeightedUndirectedGraph) WeightedEdge(uid, vid int64) graph.WeightedEdge + func (g *WeightedUndirectedGraph) WeightedEdgeBetween(xid, yid int64) graph.WeightedEdge + func (g *WeightedUndirectedGraph) WeightedEdges() graph.WeightedEdges + func (g *WeightedUndirectedGraph) WeightedLines(uid, vid int64) graph.WeightedLines + func (g *WeightedUndirectedGraph) WeightedLinesBetween(xid, yid int64) graph.WeightedLines