path: root/go/mermaid-graph.go

package main

import (
	"fmt"
	"math/rand"
	"strings"
	"time"
)

type Graph struct {
	adjacencyList map[int][]int
}

func NewGraph() *Graph {
	return &Graph{adjacencyList: make(map[int][]int)}
}

func (g *Graph) addEdge(node1, node2 int) {
	g.adjacencyList[node1] = append(g.adjacencyList[node1], node2)
	g.adjacencyList[node2] = append(g.adjacencyList[node2], node1)
}

func generateConnectedGraph(n int) *Graph {
	rand.Seed(time.Now().UnixNano())
	graph := NewGraph()

	// Start with node 0
	for i := 1; i < n; i++ {
		// Connect the new node i to a random existing node
		existingNode := rand.Intn(i)
		graph.addEdge(i, existingNode)
	}

	return graph
}

func generateMermaid(graph *Graph) string {
	var sb strings.Builder

	sb.WriteString("graph TD;\n")

	visited := make(map[string]bool)

	for node, edges := range graph.adjacencyList {
		for _, edge := range edges {
			// Ensure each edge is only printed once
			if !visited[fmt.Sprintf("%d-%d", node, edge)] && !visited[fmt.Sprintf("%d-%d", edge, node)] {
				sb.WriteString(fmt.Sprintf("    %d --> %d;\n", node, edge))
				visited[fmt.Sprintf("%d-%d", node, edge)] = true
			}
		}
	}

	return sb.String()
}

func main() {
	graph := generateConnectedGraph(100)
	mermaid := generateMermaid(graph)

	fmt.Println(mermaid)
}