expeditaet/solutions/typescript/2018/07/src/p1.ts

Advent of Code Solutions

import { split, task } from '@alexaegis/advent-of-code-lib';
import packageJson from '../package.json';
interface Graph {
	nodes: string[];
	edges: { from: string; to: string }[];
}

const interpret = (input: string) => {
	const graph: Graph = { nodes: [], edges: [] };

	for (const line of split(input)) {
		const splitLine: string[] = line.split(/ /);
		const from = splitLine[1];
		const to = splitLine[7];

		if (from !== undefined && to !== undefined) {
			if (!graph.nodes.includes(from)) {
				graph.nodes.push(from);
			}
			if (!graph.nodes.includes(to)) {
				graph.nodes.push(to);
			}
			graph.edges.push({ from, to });
		}
	}
	return graph;
};

export const p1 = (input: string): string => {
	const graph: Graph = interpret(input);
	const unprocessedNodes = graph.nodes.sort((a, b) => {
		if (a === b) {
			return 0;
		} else {
			return a > b ? 1 : -1;
		}
	});
	let unprocessedEdges = graph.edges.sort((a, b) => {
		if (a.from === b.from) {
			if (a.to === b.to) {
				return 0;
			} else {
				return a.to > b.to ? 1 : -1;
			}
		} else {
			return a.from > b.from ? 1 : -1;
		}
	});
	const result: string[] = [];
	while (unprocessedNodes.length > 0) {
		for (const node of unprocessedNodes) {
			if (unprocessedEdges.count((edge) => edge.to === node) === 0) {
				unprocessedNodes.splice(unprocessedNodes.indexOf(node), 1);
				unprocessedEdges = unprocessedEdges.filter((edge) => edge.from !== node);
				result.push(node);
				break;
			}
		}
	}
	return result.join('');
};

await task(p1, packageJson.aoc); // GRTAHKLQVYWXMUBCZPIJFEDNSO ~1ms