```ts
/**
 * Topologically sorts nodes based on given edges.
 * @param nodes - Array of node names.
 * @param edges - Array of [from, to] edges where from must come before to.
 * @returns An array of node names sorted topologically.
 */
export function topologicalSort(nodes: readonly string[], edges: readonly (readonly [string, string])[]): string[] {
    const graph: { [key: string]: string[] } = {};
    const inDegree: { [key: string]: number } = {};

    // Initialize graph and in-degree
    nodes.forEach(node => {
        graph[node] = [];
        inDegree[node] = 0;
    });

    // Build the graph and calculate in-degrees
    edges.forEach(([from, to]) => {
        if (!nodes.includes(from) || !nodes.includes(to)) {
            throw new Error(`Edge contains a node not in nodes: ${from} -> ${to}`);
        }
        graph[from].push(to);
        inDegree[to]++;
    });

    // Queue for nodes with zero in-degree
    const queue: string[] = [];
    nodes.forEach(node => {
        if (inDegree[node] === 0) {
            queue.push(node);
        }
    });

    const result: string[] = [];

    while (queue.length > 0) {
        const node = queue.shift()!;
        result.push(node);

        graph[node].forEach(neighbor => {
            inDegree[neighbor]--;
            if (inDegree[neighbor] === 0) {
                queue.push(neighbor);
            }
        });
    }

    // Check for cycles
    if (result.length !== nodes.length) {
        throw new Error('Cycle detected');
    }

    return result;
}
```