Solve 18/1 - part 1 :(

Author: code-shoily

year18/day07/main.go

@@ -0,0 +1,70 @@
+// Package day07 - Solution for Advent of Code 2018/07
+// Problem Link: http://adventofcode.com/2018/day/07
+package day07
+
+import (
+	_ "embed"
+	"fmt"
+	"github.com/code-shoily/aocgo/algo/graphs"
+	"github.com/code-shoily/aocgo/utils"
+	"strings"
+)
+
+//go:embed input.txt
+var input string
+
+// Run prints out the result of the solution.
+func Run() {
+	fmt.Println(solve(input))
+}
+
+func solve(input string) (string, int) {
+	data := parse(input)
+	return solvePart1(data), solvePart2(data)
+}
+
+func solvePart1(g *graphs.Graph) string {
+	if sorted, cycle := graphs.LexicographicalTopologicalSort(g); !cycle {
+		return strings.Join(sorted, "")
+	}
+	panic("Cycle detected :O")
+}
+
+func solvePart2(g *graphs.Graph) int {
+	return 0
+}
+
+func parse(input string) *graphs.Graph {
+	var dependencyPairs [][2]string
+	for _, line := range utils.SplitLines(input) {
+		var from, to string
+		fmt.Sscanf(line, "Step %s must be finished before step %s can begin.", &from, &to)
+		dependencyPairs = append(dependencyPairs, [2]string{from, to})
+	}
+
+	return MakeGraph(dependencyPairs)
+}
+
+func MakeGraph(deps [][2]string) *graphs.Graph {
+	graph := graphs.NewGraph(true)
+	vertices := map[string]*graphs.Vertex{}
+	for _, dep := range deps {
+		from := getVertex(dep[0], vertices)
+		to := getVertex(dep[1], vertices)
+
+		graph.AddVertex(from)
+		graph.AddVertex(to)
+		graph.AddEdge(from.ID(), to.ID(), 1)
+	}
+
+	return graph
+}
+
+func getVertex(key string, vertexMap map[string]*graphs.Vertex) *graphs.Vertex {
+	if vertex, exists := vertexMap[key]; exists {
+		return vertex
+	}
+	vertexMap[key] = graphs.NewSimpleVertex(key)
+
+	return vertexMap[key]
+}

year18/day07/main_test.go

@@ -0,0 +1,38 @@
+package day07
+
+import (
+	"testing"
+)
+
+func TestSolve(t *testing.T) {
+	solve1, solve2 := solve(input)
+	expected1, expected2 := 0, 0
+
+	if solve1 != expected1 {
+		t.Errorf("Fail - part 1. Expected %d, got %d", expected1, solve1)
+	}
+
+	if solve2 != expected2 {
+		t.Errorf("Fail - part 2. Expected %d, got %d", expected2, solve2)
+	}
+}
+
+func BenchmarkSolvePart1(b *testing.B) {
+	data := parse(input)
+	for i := 0; i < b.N; i++ {
+		solvePart1(data)
+	}
+}
+
+func BenchmarkSolvePart2(b *testing.B) {
+	data := parse(input)
+	for i := 0; i < b.N; i++ {
+		solvePart2(data)
+	}
+}
+
+func BenchmarkSolve(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		solve(input)
+	}
+}

year18/runner.go

@@ -7,6 +7,7 @@ import (
 	"github.com/code-shoily/aocgo/year18/day03"
 	"github.com/code-shoily/aocgo/year18/day04"
 	"github.com/code-shoily/aocgo/year18/day05"
+	"github.com/code-shoily/aocgo/year18/day07"
 )
 
 func SolveForDay(day int) {
@@ -21,6 +22,8 @@ func SolveForDay(day int) {
 		day04.Run()
 	case 5:
 		day05.Run()
+	case 7:
+		day07.Run()
 	default:
 		fmt.Printf("2018/%d has not been solved yet", day)
 	}