add day-23 + benchmarks

day-23/internal/one/benchmark

@@ -0,0 +1,6 @@
+goos: linux
+goarch: amd64
+pkg: github.com/onyx-and-iris/aoc2024/day-23/internal/one
+cpu: Intel(R) Core(TM) i7-8700K CPU @ 3.70GHz
+BenchmarkSolve-12    	1000000000	         0.003422 ns/op
+ok  	github.com/onyx-and-iris/aoc2024/day-23/internal/one	0.029s

day-23/internal/one/solve.go

@@ -0,0 +1,51 @@
+package one
+
+import (
+	"bytes"
+	"slices"
+	"strings"
+
+	"github.com/onyx-and-iris/aoc2024/day-23/internal/set"
+)
+
+func Solve(buf []byte) (int, error) {
+	r := bytes.NewReader(buf)
+	connections, err := parseLines(r)
+	if err != nil {
+		return 0, err
+	}
+
+	networks := make(map[string]*set.Set)
+	for _, connection := range connections {
+		if _, found := networks[connection[0]]; !found {
+			networks[connection[0]] = set.New()
+		}
+		networks[connection[0]].Add(connection[1])
+
+		if _, found := networks[connection[1]]; !found {
+			networks[connection[1]] = set.New()
+		}
+		networks[connection[1]].Add(connection[0])
+	}
+
+	setIdentifiers := make(map[string]struct{})
+	for name := range networks {
+		if !strings.HasPrefix(name, "t") {
+			continue
+		}
+
+		for _, node := range networks[name].List() {
+			for _, node2 := range networks[node].List() {
+				if slices.Contains(networks[node2].List(), name) {
+					s := set.New()
+					s.Add(name)
+					s.Add(node)
+					s.Add(node2)
+					setIdentifiers[s.String()] = struct{}{}
+				}
+			}
+		}
+	}
+
+	return len(setIdentifiers), nil
+}

day-23/internal/one/solve_internal_test.go

@@ -0,0 +1,15 @@
+package one
+
+import (
+	_ "embed"
+	"os"
+	"testing"
+)
+
+//go:embed testdata/input.txt
+var data []byte
+
+func BenchmarkSolve(b *testing.B) {
+	os.Stdout, _ = os.Open(os.DevNull)
+	Solve(data)
+}

day-23/internal/one/util.go

@@ -0,0 +1,22 @@
+package one
+
+import (
+	"bufio"
+	"io"
+	"strings"
+)
+
+func parseLines(r io.Reader) ([][]string, error) {
+	connections := [][]string{}
+
+	scanner := bufio.NewScanner(r)
+	for scanner.Scan() {
+		connections = append(connections, strings.Split(scanner.Text(), "-"))
+	}
+
+	if err := scanner.Err(); err != nil {
+		return nil, err
+	}
+
+	return connections, nil
+}

day-23/internal/set/set.go

@@ -0,0 +1,75 @@
+package set
+
+import (
+	"fmt"
+	"slices"
+)
+
+// Set is a collection of unique elements
+type Set struct {
+	elements map[string]struct{}
+}
+
+// New creates a new set
+func New() *Set {
+	return &Set{
+		elements: make(map[string]struct{}),
+	}
+}
+
+func (s *Set) String() string {
+	l := s.List()
+	slices.Sort(l)
+	return fmt.Sprintf("%v", l)
+}
+
+// Add inserts an element into the set
+func (s *Set) Add(value string) {
+	s.elements[value] = struct{}{}
+}
+
+// Remove deletes an element from the set
+func (s *Set) Remove(value string) {
+	delete(s.elements, value)
+}
+
+// Contains checks if an element is in the set
+func (s *Set) Contains(value string) bool {
+	_, found := s.elements[value]
+	return found
+}
+
+// Size returns the number of elements in the set
+func (s *Set) Size() int {
+	return len(s.elements)
+}
+
+// List returns all elements in the set as a slice
+func (s *Set) List() []string {
+	keys := make([]string, 0, len(s.elements))
+	for key := range s.elements {
+		keys = append(keys, key)
+	}
+	return keys
+}
+
+func (s *Set) Union(other *Set) *Set {
+	result := New()
+	for key := range s.elements {
+		result.Add(key)
+	}
+	for key := range other.elements {
+		result.Add(key)
+	}
+	return result
+}
+
+func (s *Set) Intersection(other *Set) *Set {
+	result := New()
+	for key := range s.elements {
+		if other.Contains(key) {
+			result.Add(key)
+		}
+	}
+	return result
+}

day-23/internal/two/benchmark

@@ -0,0 +1,6 @@
+goos: linux
+goarch: amd64
+pkg: github.com/onyx-and-iris/aoc2024/day-23/internal/two
+cpu: Intel(R) Core(TM) i7-8700K CPU @ 3.70GHz
+BenchmarkSolve-12    	1000000000	         0.2431 ns/op
+ok  	github.com/onyx-and-iris/aoc2024/day-23/internal/two	3.693s

day-23/internal/two/clique.go

@@ -0,0 +1,16 @@
+package two
+
+import "slices"
+
+type clique struct {
+	values []string
+}
+
+func (c *clique) Len() int {
+	return len(c.values)
+}
+
+func (c *clique) sorted() []string {
+	slices.Sort(c.values)
+	return c.values
+}

day-23/internal/two/solve.go

@@ -0,0 +1,83 @@
+package two
+
+import (
+	"bytes"
+	"slices"
+	"strings"
+	"sync"
+
+	"github.com/onyx-and-iris/aoc2024/day-23/internal/set"
+	log "github.com/sirupsen/logrus"
+)
+
+func Solve(buf []byte) (string, error) {
+	r := bytes.NewReader(buf)
+	connections, err := parseLines(r)
+	if err != nil {
+		return "", err
+	}
+
+	networks := make(map[string]*set.Set)
+	nodes := set.New()
+	for _, connection := range connections {
+		if _, found := networks[connection[0]]; !found {
+			networks[connection[0]] = set.New()
+		}
+		networks[connection[0]].Add(connection[1])
+
+		if _, found := networks[connection[1]]; !found {
+			networks[connection[1]] = set.New()
+		}
+		networks[connection[1]].Add(connection[0])
+
+		nodes.Add(connection[0])
+		nodes.Add(connection[1])
+	}
+
+	cliquesChan := make(chan clique)
+	var wg sync.WaitGroup
+	wg.Add(1)
+	go func() {
+		defer wg.Done()
+		next([]string{}, nodes, set.New(), cliquesChan, networks, &wg)
+	}()
+
+	go func() {
+		wg.Wait()
+		close(cliquesChan)
+	}()
+
+	var maxLen int
+	var maxLenClique []string
+	for c := range cliquesChan {
+		if c.Len() > maxLen {
+			maxLen = c.Len()
+			maxLenClique = c.sorted()
+			log.Debug(c)
+		}
+	}
+
+	return strings.Join(maxLenClique, ","), nil
+}
+
+func next(
+	R []string,
+	P, X *set.Set,
+	cliquesChan chan<- clique,
+	networks map[string]*set.Set,
+	wg *sync.WaitGroup,
+) {
+	if P.Size() == 0 && X.Size() == 0 {
+		cliquesChan <- clique{slices.Clone(R)}
+		return
+	}
+
+	for _, v := range P.List() {
+		nextR := append(R, v)
+
+		next(nextR, P.Intersection(networks[v]), X.Intersection(networks[v]), cliquesChan, networks, wg)
+
+		P.Remove(v)
+		X.Add(v)
+	}
+}

day-23/internal/two/solve_internal_test.go

@@ -0,0 +1,15 @@
+package two
+
+import (
+	_ "embed"
+	"os"
+	"testing"
+)
+
+//go:embed testdata/input.txt
+var data []byte
+
+func BenchmarkSolve(b *testing.B) {
+	os.Stdout, _ = os.Open(os.DevNull)
+	Solve(data)
+}

day-23/internal/two/util.go

@@ -0,0 +1,22 @@
+package two
+
+import (
+	"bufio"
+	"io"
+	"strings"
+)
+
+func parseLines(r io.Reader) ([][]string, error) {
+	connections := [][]string{}
+
+	scanner := bufio.NewScanner(r)
+	for scanner.Scan() {
+		connections = append(connections, strings.Split(scanner.Text(), "-"))
+	}
+
+	if err := scanner.Err(); err != nil {
+		return nil, err
+	}
+
+	return connections, nil
+}