graph

package
v0.1.0 Latest Latest
Warning

This package is not in the latest version of its module.

 Go to latest Published: Jun 2, 2026 License: MIT Imports: 4 Imported by: 0

Documentation

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type EdgeView 

type EdgeView struct {
	From  int     `json:"from"`
	To    int     `json:"to"`
	Value float32 `json:"value,omitempty"`
}

type Graph 

type Graph[S comparable, T any] struct {
	Vertices map[S]T             `json:"vertices,omitempty"`
	Edges    map[S]map[S]float32 `json:"edges,omitempty"`
}

func NewGraph 

func NewGraph[S comparable, T any]() *Graph[S, T]

func (*Graph[S, T]) ConnectedGraph 

func (g *Graph[S, T]) ConnectedGraph(seed S) *Graph[S, T]

func (*Graph[S, T]) ConnectedGraphContext 

func (g *Graph[S, T]) ConnectedGraphContext(ctx context.Context, seed S) (*Graph[S, T], error)

ConnectedGraphContext is the context-aware variant of ConnectedGraph. It returns ctx.Err() as soon as the context is cancelled or its deadline has expired, so callers can short-circuit large traversals.

func (*Graph[S, T]) MaximumSpanningTree 

func (g *Graph[S, T]) MaximumSpanningTree(seed S) *Graph[S, T]

MaximumSpanningTree returns a maximum spanning tree of the graph rooted at seed.

func (*Graph[S, T]) MaximumSpanningTreeContext 

func (g *Graph[S, T]) MaximumSpanningTreeContext(ctx context.Context, seed S) (*Graph[S, T], error)

MaximumSpanningTreeContext is the context-aware variant of Graph.MaximumSpanningTree.

func (*Graph[S, T]) MinimumSpanningTree 

func (g *Graph[S, T]) MinimumSpanningTree(seed S) *Graph[S, T]

MinimumSpanningTree returns a minimum spanning tree of the graph rooted at seed.

func (*Graph[S, T]) MinimumSpanningTreeContext 

func (g *Graph[S, T]) MinimumSpanningTreeContext(ctx context.Context, seed S) (*Graph[S, T], error)

MinimumSpanningTreeContext is the context-aware variant of Graph.MinimumSpanningTree.

func (*Graph[S, T]) PutEdge 

func (g *Graph[S, T]) PutEdge(tail, head S, weight float32)

func (*Graph[S, T]) PutVertex 

func (g *Graph[S, T]) PutVertex(key S, value T)

func (*Graph[S, T]) Render 

func (g *Graph[S, T]) Render(key2int func(k S) int, value2string func(v T) string) GraphView

func (*Graph[S, T]) ShortestPathTree 

func (g *Graph[S, T]) ShortestPathTree(seed S, costFunc func(x float32) float32) *Graph[S, T]

ShortestPathTree

  • ShortestPathTree returns a shortest path tree of the graph from the seed.
  • The costFunc is a function that returns the cost of the edge.
  • Typically, if the weight means like `importance`, the costFunc is a function that returns the 1 / weight.
  • It is calculated by Dijkstra's algorithm, so the costFunc must return a positive value.

func (*Graph[S, T]) ShortestPathTreeContext 

func (g *Graph[S, T]) ShortestPathTreeContext(ctx context.Context, seed S, costFunc func(x float32) float32) (*Graph[S, T], error)

ShortestPathTreeContext is the context-aware variant of ShortestPathTree.

type GraphView 

type GraphView struct {
	Vertices []VertexView `json:"nodes"`
	Edges    []EdgeView   `json:"edges"`
}

type VertexView 

type VertexView struct {
	ID    int    `json:"id"`
	Label string `json:"label"`
	Value string `json:"value,omitempty"`
}

Source Files

View all Source files

Directories

Path Synopsis

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL
go.dev uses cookies from Google to deliver and enhance the quality of its services and to analyze traffic. Learn more.