Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security Policy
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

graph

package

Go to main page

Versions in this module

v0

v0.6.6

Sep 25, 2023

Changes in this version

+ type AdjacencyMap map[NodeID]EdgeMap

+ func BuildAdjacencyMap(g Graph) (AdjacencyMap, error)

+ func (a AdjacencyMap) DeepEqual(b AdjacencyMap) bool

+ type Edge graph.Edge[NodeID]

+ func (e Edge) DeepEqual(other Edge) bool

+ func (e Edge) ToMeshEdge(source, target NodeID) MeshEdge

+ type EdgeMap map[NodeID]Edge

+ func (e EdgeMap) DeepEqual(other EdgeMap) bool

type Graph

+ func NewTestGraph() (Graph, error)

+ type MeshEdge struct

+ func (e *MeshEdge) UnmarshalJSON(data []byte) error

+ func (e MeshEdge) AsGraphEdge() graph.Edge[NodeID]

+ func (e MeshEdge) EdgeProperties() graph.EdgeProperties

+ func (e MeshEdge) MarshalJSON() ([]byte, error)

+ func (e MeshEdge) PutInto(g Graph) error

+ func (e MeshEdge) SourceID() NodeID

+ func (e MeshEdge) TargetID() NodeID

+ func (e MeshEdge) ToEdge() Edge

type MeshNode

+ func (n *MeshNode) UnmarshalJSON(data []byte) error

+ func (n MeshNode) MarshalJSON() ([]byte, error)

+ func (n MeshNode) NodeID() NodeID

+ type NodeID string

+ func (id NodeID) String() string

v0.6.5

Sep 24, 2023

Changes in this version

+ const EdgesPrefix

+ const NodesPrefix

+ var ErrEdgeNotFound = graph.ErrEdgeNotFound

+ func NewGraphStore(st storage.MeshStorage) graph.Store[string, MeshNode]

+ type Graph graph.Graph[string, MeshNode]

+ func NewGraph(st storage.MeshStorage) Graph

+ type GraphStore struct

+ func (g *GraphStore) AddEdge(sourceNode, targetNode string, edge graph.Edge[string]) error

+ func (g *GraphStore) AddVertex(nodeID string, node MeshNode, props graph.VertexProperties) error

+ func (g *GraphStore) Edge(sourceNode, targetNode string) (graph.Edge[string], error)

+ func (g *GraphStore) ListEdges() ([]graph.Edge[string], error)

+ func (g *GraphStore) ListVertices() ([]string, error)

+ func (g *GraphStore) RemoveEdge(sourceNode, targetNode string) error

+ func (g *GraphStore) RemoveVertex(nodeID string) error

+ func (g *GraphStore) UpdateEdge(sourceNode, targetNode string, edge graph.Edge[string]) error

+ func (g *GraphStore) Vertex(nodeID string) (node MeshNode, props graph.VertexProperties, err error)

+ func (g *GraphStore) VertexCount() (int, error)

+ type MeshNode struct

+ func (n *MeshNode) DNSPort() uint16

+ func (n *MeshNode) HasFeature(feature v1.Feature) bool

+ func (n *MeshNode) PortFor(feature v1.Feature) uint16

+ func (n *MeshNode) PrivateAddrV4() netip.Prefix

+ func (n *MeshNode) PrivateAddrV6() netip.Prefix

+ func (n *MeshNode) PrivateDNSAddrV4() netip.AddrPort

+ func (n *MeshNode) PrivateDNSAddrV6() netip.AddrPort

+ func (n *MeshNode) PrivateRPCAddrV4() netip.AddrPort

+ func (n *MeshNode) PrivateRPCAddrV6() netip.AddrPort

+ func (n *MeshNode) PrivateRaftAddrV4() netip.AddrPort

+ func (n *MeshNode) PrivateRaftAddrV6() netip.AddrPort

+ func (n *MeshNode) PrivateTURNAddrV4() netip.AddrPort

+ func (n *MeshNode) PrivateTURNAddrV6() netip.AddrPort

+ func (n *MeshNode) PublicDNSAddr() netip.AddrPort

+ func (n *MeshNode) PublicRPCAddr() netip.AddrPort

+ func (n *MeshNode) RPCPort() uint16

+ func (n *MeshNode) RaftPort() uint16

+ func (n *MeshNode) TURNPort() uint16

+ func (n *MeshNode) Unmarshal(data []byte) error