KindGraph type for distinguishing directed and undirected graphs.
When to use
Use when writing graph-polymorphic types or helpers that need to preserve whether a graph is directed or undirected.
Source effect/Graph.ts:1091 lines
Referenced by 47 symbols
Graph.GraphGraph.MutableGraphGraph.addEdgeGraph.addNodeGraph.astarGraph.beginMutationGraph.bellmanFordGraph.bfsGraph.dfsGraph.dfsPostOrderGraph.dijkstraGraph.edgeCountGraph.edgesGraph.endMutationGraph.externalsGraph.filterEdgesGraph.filterMapEdgesGraph.filterMapNodesGraph.filterNodesGraph.findEdgeGraph.findEdgesGraph.findNodeGraph.findNodesGraph.floydWarshallGraph.getEdgeGraph.getNodeGraph.hasEdgeGraph.hasNodeGraph.isAcyclicGraph.mapEdgesGraph.mapNodesGraph.mutateGraph.neighborsGraph.neighborsDirectedGraph.nodeCountGraph.nodesGraph.predecessorsGraph.removeEdgeGraph.removeNodeGraph.reverse+7 more