effect 4.0.0-rc.112 → 4.0.0-rc.113

package/dist/Graph.js

@@ -16,7 +16,6 @@ import * as internal from "./internal/graph.js";
 import * as csr from "./internal/graphCsr.js";
 import * as MutableHashMap from "./MutableHashMap.js";
 import * as Option from "./Option.js";
-import { hasProperty } from "./Predicate.js";
 const TypeId = internal.TypeId;
 /** @internal */
 const copyEdge = edge => ({
@@ -97,7 +96,7 @@ const withMutationGuard = (graph, evaluate) => graph.mutable ? internal.withTran
  * @category guards
  * @since 4.0.0
  */
-export const isGraph = u => hasProperty(u, TypeId);
+export const isGraph = internal.isGraph;
 /**
  * Reconstructs an immutable graph from its indexed active structure.
  *
@@ -457,7 +456,7 @@ const mutateScoped = (mutable, f) => {
  *
  * **When to use**
  *
- * Use for the usual immutable update workflow when several node or edge
+ * Use when several node or edge
  * mutations should be applied together.
  *
  * **Details**
@@ -2282,6 +2281,8 @@ export const edgeCount = graph => internal.toImpl(graph).edges.size;
 /**
  * Returns the indices of all edges incident to a node.
  *
+ * **Details**
+ *
  * Each edge is returned once in graph edge order, including self-loops.
  * Throws a `GraphError` when the node does not exist.
  *
@@ -2331,6 +2332,8 @@ export const incidentEdges = /*#__PURE__*/dual(2, (graph, nodeIndex) => {
 /**
  * Returns the indices of outgoing edges for a node in a directed graph.
  *
+ * **Details**
+ *
  * Parallel edges and self-loops are returned separately in adjacency order.
  * Throws a `GraphError` for an undirected graph or missing node.
  *
@@ -2352,6 +2355,8 @@ export const outgoingEdges = /*#__PURE__*/dual(2, (graph, nodeIndex) => {
 /**
  * Returns the indices of incoming edges for a node in a directed graph.
  *
+ * **Details**
+ *
  * Parallel edges and self-loops are returned separately in reverse-adjacency
  * order. Throws a `GraphError` for an undirected graph or missing node.
  *
@@ -2373,6 +2378,8 @@ export const incomingEdges = /*#__PURE__*/dual(2, (graph, nodeIndex) => {
 /**
  * Returns all edge indices connecting the supplied nodes.
  *
+ * **Details**
+ *
  * Directed graphs only include edges from `source` to `target`; undirected
  * graphs include either stored orientation. Parallel edges are retained.
  * Throws a `GraphError` when either node does not exist.
@@ -2406,6 +2413,8 @@ export const edgesBetween = /*#__PURE__*/dual(3, (graph, source, target) => {
 /**
  * Returns the degree of a node in an undirected graph.
  *
+ * **Details**
+ *
  * Parallel edges count separately and a self-loop contributes two. Throws a
  * `GraphError` for a directed graph or missing node.
  *
@@ -2427,6 +2436,8 @@ export const degree = /*#__PURE__*/dual(2, (graph, nodeIndex) => {
 /**
  * Returns the out-degree of a node in a directed graph.
  *
+ * **Details**
+ *
  * Parallel edges count separately and a self-loop contributes one. Throws a
  * `GraphError` for an undirected graph or missing node.
  *
@@ -2448,6 +2459,8 @@ export const outDegree = /*#__PURE__*/dual(2, (graph, nodeIndex) => {
 /**
  * Returns the in-degree of a node in a directed graph.
  *
+ * **Details**
+ *
  * Parallel edges count separately and a self-loop contributes one. Throws a
  * `GraphError` for an undirected graph or missing node.
  *
@@ -5253,7 +5266,7 @@ export const bellmanFord = /*#__PURE__*/dual(2, (graph, config) => {
   const edges = csr.getEdges(cache);
   const edgeIds = csr.getEdgeIds(cache);
   const edgeCache = csr.getEdgeEndpoints(cache);
-  const outgoing = csr.getOutgoing(cache);
+  const outgoing = csr.getOutgoingWithEdges(cache);
   const source = csr.getNodeIndex(cache, config.source);
   const target = csr.getNodeIndex(cache, config.target);
   const weights = new Float64Array(edges.length);
@@ -5342,7 +5355,9 @@ export const bellmanFord = /*#__PURE__*/dual(2, (graph, config) => {
     while (head < tail) {
       const node = queue[head++];
       for (let i = outgoing.rowOffsets[node]; i < outgoing.rowOffsets[node + 1]; i++) {
-        markAffected(outgoing.columnIndices[i]);
+        if (weights[outgoing.edgeIndices[i]] !== Infinity) {
+          markAffected(outgoing.columnIndices[i]);
+        }
       }
     }
   }