graphing intersections about isect HOT 3 CLOSED

  const lineNodeMapping = new Map<string, Set<string>>();
  const intersections = detectIntersections.run();
  const graph = createGraph<{ point: { x: number; y: number } }>();
  intersections.forEach((intersection) => {
    const intersectionId = isectPointToId(intersection.point);
    graph.addNode(intersectionId, { point: intersection.point });
    intersection.segments.forEach((isectSegment) => {
      const fromId = isectPointToId(isectSegment.from);
      const toId = isectPointToId(isectSegment.to);
      const lineId = `${fromId}-${toId}`;
      const lineNodes = lineNodeMapping.get(lineId) ?? new Set();
      graph.addNode(fromId, { point: isectSegment.from });
      graph.addNode(toId, { point: isectSegment.to });
      graph.addLink(fromId, intersectionId);
      graph.addLink(toId, intersectionId);
      // link this intersection with other intersections on that line
      lineNodes.forEach((nodeId) => {
        graph.addLink(nodeId, intersectionId);
      });
      lineNodes.add(intersectionId);
      lineNodeMapping.set(lineId, lineNodes);
    });
  });

function pointsToGraph(points: Point[]) {
  const xValues: Set<number> = new Set();
  const yValues: Set<number> = new Set();
  const graph = createGraph<{ point: Point }>();

  points.forEach((point) => {
    const [x, y] = point;
    xValues.add(x);
    yValues.add(y);
    graph.addNode(pointId(x, y), { point });
  });

  function pointId(x: number, y: number) {
    return `${x},${y}`;
  }

  const sortedXValues = Array.from(xValues).sort((a, b) => a - b);
  const sortedYValues = Array.from(yValues).sort((a, b) => a - b);
  for (let i = 0; i < sortedYValues.length; i++) {
    for (let j = 0; j < sortedXValues.length; j++) {
      const x = sortedXValues[j];
      const y = sortedYValues[i];
      const currentId = pointId(x, y);
      // eslint-disable-next-line no-continue
      if (!graph.hasNode(currentId)) continue;

      for (let k = j - 1; k >= 0; k--) {
        const previousXId = pointId(sortedXValues[k], y);
        if (graph.hasNode(previousXId)) {
          graph.addLink(previousXId, currentId);
          break;
        }
      }

      for (let k = i - 1; k >= 0; k--) {
        const previousYId = pointId(x, sortedYValues[k]);
        if (graph.hasNode(previousYId)) {
          graph.addLink(previousYId, currentId);
          break;
        }
      }
    }
  }

  return graph;
}