(edge: Option.Option<Graph.Edge<E>>)
| 3 | |
| 4 | const directed = <N, E>( |
| 5 | nodes: ReadonlyArray<N>, |
| 6 | edges: ReadonlyArray<readonly [Graph.NodeIndex, Graph.NodeIndex, E]> |
| 7 | ) => |
| 8 | Graph.directed<N, E>((mutable) => { |
| 9 | for (const node of nodes) Graph.addNode(mutable, node) |
| 10 | for (const [source, target, data] of edges) Graph.addEdge(mutable, source, target, data) |
| 11 | }) |
| 12 | |
| 13 | const undirected = <N, E>( |
no outgoing calls
no test coverage detected
searching dependent graphs…