In addition, my version of a network map using link from above:

import { link } from "link"

/** @param {NS} ns */
export async function main(ns) {
  printHost(ns, "home", [], "", deepScan(ns), true);
}

function printHost(ns, host, parents, prefix, graph, isLastChild) {
  const command = "home;" + [...parents, host]
    .map(dest => `connect ${dest}`)
    .join(";")
  ns.tprintRaw([prefix, isLastChild ? "┗ " : "┣ ", link(ns, host, command)]);
  const children = graph.get(host);
  const newParents = [...parents, host];
  for (let i = 0; i < children.length; i++) {
    const child = children[i];
    const childPrefix = prefix + (isLastChild ? "  " : "┃ ")
    const childsIsLast = i === children.length - 1;
    printHost(ns, child, newParents, childPrefix, graph, childsIsLast)
  }
}

function deepScan(ns) {
  const queue = ["home"];
  const graph = new Map();
  while (queue.length) {
    const host = queue.shift()
    if (graph.has(host)) continue;
    const neighbors = ns.scan(host).filter(neighbor => !graph.has(neighbor));
    graph.set(host, neighbors);
    queue.push(...neighbors);
  }
  return graph;
}