graph

Graph

This package provides a simple implementation of a graph data structures useing adjacency list representation written in Go.

features

graph.DirectedGraph : directed graph
graph.UndirectedGraph : undirected graph

Both structure implements graph.Graph.

type Graph interface {
	AddEdge(i1, i2 int)
	DeleteEdge(i1, i2 int)
	ForEachSuccessor(index int, f func(int))
	GetDegree(index int) int
	HasEdge(i1, i2 int) bool
	Order() int
	Size() int
	Clear()
}

example

package main

import (
	"fmt"

	"github.com/TadaTeruki/graph"
)

func main() {
	g := graph.NewDirectedGraph(4) // Create a new graph with 4 vertices

	g.AddEdge(0, 1) // Add an edge from 0 to 1

	g.AddEdge(2, 3) // Add an edge from 0 to 2

	// Add more edges
	g.AddEdge(1, 2)
	g.AddEdge(0, 2)

	for i := 0; i < g.Order(); i++ {
		fmt.Println("Vertex", i, "has degree", g.GetDegree(i))
		g.ForEachSuccessor(i, func(j int) {
			fmt.Println("Vertex", i, "has edge for: ", j)
		})
	}
}