Graphs

Documentation

Index

• func NewVertex(key string) *vertex
• type Graph
  • func NewGraph() *Graph
  • func (g *Graph) AddEdge(src, dst string, weight float64) (bool, error)
  • func (g *Graph) AddVertex(key string) (*vertex, error)
  • func (g *Graph) GetVertex(key string) *vertex
  • func (g *Graph) RemoveEdge(src, dst string) (bool, error)
  • func (g *Graph) RemoveVertex(key string) (bool, error)
  • func (g *Graph) ShortestPath(src *vertex) map[string]float64

Functions

func NewVertex

func NewVertex(key string) *vertex

initializes a new node and sets its key

Types

type Graph

type Graph struct {
	// contains filtered or unexported fields
}

func NewGraph

func NewGraph() *Graph

initialize a new graph

func (*Graph) AddEdge

func (g *Graph) AddEdge(src, dst string, weight float64) (bool, error)

Adds an edge between two vertices

func (*Graph) AddVertex

func (g *Graph) AddVertex(key string) (*vertex, error)

Adds a new vertex to the graph

func (*Graph) GetVertex

func (g *Graph) GetVertex(key string) *vertex

Returns a vertex from the graph

func (*Graph) RemoveEdge

func (g *Graph) RemoveEdge(src, dst string) (bool, error)

Removes an edge between two nodes

func (*Graph) RemoveVertex

func (g *Graph) RemoveVertex(key string) (bool, error)

Removes a vertex from the graph

func (*Graph) ShortestPath

func (g *Graph) ShortestPath(src *vertex) map[string]float64

Compute the shortest path from a source to all other vertices using Dijkstra's algorithm. Returns a map of vertices and their distances from the source.