Versions in this module Expand all Collapse all v0 v0.6.5 Feb 5, 2020 v0.6.3 Feb 5, 2020 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) NewEdge(from, to graph.Node) graph.Edge + func (g *DirectedGraph) NewNode() graph.Node + func (g *DirectedGraph) Node(id int64) graph.Node + func (g *DirectedGraph) Nodes() graph.Nodes + func (g *DirectedGraph) RemoveEdge(fid, tid int64) + func (g *DirectedGraph) RemoveNode(id int64) + func (g *DirectedGraph) SetEdge(e graph.Edge) + func (g *DirectedGraph) To(id int64) graph.Nodes + type DirectedMatrix struct + func NewDirectedMatrix(n int, init, self, absent float64) *DirectedMatrix + func NewDirectedMatrixFrom(nodes []graph.Node, init, self, absent float64) *DirectedMatrix + func (g *DirectedMatrix) Edge(uid, vid int64) graph.Edge + func (g *DirectedMatrix) Edges() graph.Edges + func (g *DirectedMatrix) From(id int64) graph.Nodes + func (g *DirectedMatrix) HasEdgeBetween(xid, yid int64) bool + func (g *DirectedMatrix) HasEdgeFromTo(uid, vid int64) bool + func (g *DirectedMatrix) Matrix() mat.Matrix + func (g *DirectedMatrix) Node(id int64) graph.Node + func (g *DirectedMatrix) Nodes() graph.Nodes + func (g *DirectedMatrix) RemoveEdge(fid, tid int64) + func (g *DirectedMatrix) SetEdge(e graph.Edge) + func (g *DirectedMatrix) SetWeightedEdge(e graph.WeightedEdge) + func (g *DirectedMatrix) To(id int64) graph.Nodes + func (g *DirectedMatrix) Weight(xid, yid int64) (w float64, ok bool) + func (g *DirectedMatrix) WeightedEdge(uid, vid int64) graph.WeightedEdge + func (g *DirectedMatrix) WeightedEdges() graph.WeightedEdges + 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 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) NewEdge(from, to graph.Node) graph.Edge + func (g *UndirectedGraph) NewNode() graph.Node + func (g *UndirectedGraph) Node(id int64) graph.Node + func (g *UndirectedGraph) Nodes() graph.Nodes + func (g *UndirectedGraph) RemoveEdge(fid, tid int64) + func (g *UndirectedGraph) RemoveNode(id int64) + func (g *UndirectedGraph) SetEdge(e graph.Edge) + type UndirectedMatrix struct + func NewUndirectedMatrix(n int, init, self, absent float64) *UndirectedMatrix + func NewUndirectedMatrixFrom(nodes []graph.Node, init, self, absent float64) *UndirectedMatrix + func (g *UndirectedMatrix) Edge(uid, vid int64) graph.Edge + func (g *UndirectedMatrix) EdgeBetween(uid, vid int64) graph.Edge + func (g *UndirectedMatrix) Edges() graph.Edges + func (g *UndirectedMatrix) From(id int64) graph.Nodes + func (g *UndirectedMatrix) HasEdgeBetween(uid, vid int64) bool + func (g *UndirectedMatrix) Matrix() mat.Matrix + func (g *UndirectedMatrix) Node(id int64) graph.Node + func (g *UndirectedMatrix) Nodes() graph.Nodes + func (g *UndirectedMatrix) RemoveEdge(fid, tid int64) + func (g *UndirectedMatrix) SetEdge(e graph.Edge) + func (g *UndirectedMatrix) SetWeightedEdge(e graph.WeightedEdge) + func (g *UndirectedMatrix) Weight(xid, yid int64) (w float64, ok bool) + func (g *UndirectedMatrix) WeightedEdge(uid, vid int64) graph.WeightedEdge + func (g *UndirectedMatrix) WeightedEdgeBetween(uid, vid int64) graph.WeightedEdge + func (g *UndirectedMatrix) WeightedEdges() graph.WeightedEdges + type WeightedDirectedGraph struct + func NewWeightedDirectedGraph(self, absent float64) *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) NewNode() graph.Node + func (g *WeightedDirectedGraph) NewWeightedEdge(from, to graph.Node, weight float64) graph.WeightedEdge + func (g *WeightedDirectedGraph) Node(id int64) graph.Node + func (g *WeightedDirectedGraph) Nodes() graph.Nodes + func (g *WeightedDirectedGraph) RemoveEdge(fid, tid int64) + func (g *WeightedDirectedGraph) RemoveNode(id int64) + func (g *WeightedDirectedGraph) SetWeightedEdge(e graph.WeightedEdge) + func (g *WeightedDirectedGraph) To(id int64) graph.Nodes + func (g *WeightedDirectedGraph) Weight(xid, yid int64) (w float64, ok bool) + func (g *WeightedDirectedGraph) WeightedEdge(uid, vid int64) graph.WeightedEdge + func (g *WeightedDirectedGraph) WeightedEdges() graph.WeightedEdges + type WeightedEdge struct + F graph.Node + T graph.Node + W 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 WeightedUndirectedGraph struct + func NewWeightedUndirectedGraph(self, absent float64) *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) NewNode() graph.Node + func (g *WeightedUndirectedGraph) NewWeightedEdge(from, to graph.Node, weight float64) graph.WeightedEdge + func (g *WeightedUndirectedGraph) Node(id int64) graph.Node + func (g *WeightedUndirectedGraph) Nodes() graph.Nodes + func (g *WeightedUndirectedGraph) RemoveEdge(fid, tid int64) + func (g *WeightedUndirectedGraph) RemoveNode(id int64) + func (g *WeightedUndirectedGraph) SetWeightedEdge(e graph.WeightedEdge) + 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
Go to main page