Function addEdge

repos/effect/packages/effect/src/Graph.ts:1411–1463

(
  mutable: MutableGraph<N, E, T>,
  source: NodeIndex,
  target: NodeIndex,
  data: E
)

export const complement: {
  <N, E>(
    createEdge: (source: N, target: N) => E
  ): <T extends Kind = "directed">(self: Graph<N, E, T>) => Graph<N, E, T>
  <N, E, T extends Kind = "directed">(
    self: Graph<N, E, T>,
    createEdge: (source: N, target: N) => E
  ): Graph<N, E, T>
} = dual(2, <N, E, T extends Kind>(
  self: Graph<N, E, T>,
  createEdge: (source: N, target: N) => E
): Graph<N, E, T> => {
  const cache = csr.get(self)
  const outgoing = csr.getOutgoing(cache)
  const neighborMarks = new Uint32Array(cache.nodeIds.length)

  return make(self.type)<N, E>((mutable) => {
    const newIndices = new Uint32Array(cache.nodeIds.length)

    for (let i = 0; i < cache.nodeIds.length; i++) {
      newIndices[i] = addNode(mutable, cache.nodeData[i] as N)
    }

    for (let i = 0; i < cache.nodeIds.length; i++) {
      const generation = i + 1
      for (let edge = outgoing.rowOffsets[i]; edge < outgoing.rowOffsets[i + 1]; edge++) {
        neighborMarks[outgoing.columnIndices[edge]] = generation
      }
      const start = self.type === "undirected" ? i + 1 : 0

      for (let j = start; j < cache.nodeIds.length; j++) {
        if (i === j || neighborMarks[j] === generation) {
          continue
        }
        addEdge(mutable, newIndices[i], newIndices[j], createEdge(cache.nodeData[i] as N, cache.nodeData[j] as N))
      }
    }
  })
})

/**
 * Configuration for selecting a graph neighborhood.
 *
 * **Details**
 *
 * `radius` limits the edge distance from the center node and defaults to `1`.
 * It accepts non-negative integers and `Infinity`.
 * `direction` controls how directed edges are traversed and defaults to
 * `"outgoing"`.
 *
 * @category configuration
 * @since 4.0.0
 */
export interface NeighborhoodConfig {
  readonly radius?: number
  readonly direction?: TraversalDirection
}