graphology - npm Package Versions

0.23.0

• Adding #.updateAttributes.
• Adding #.updateNodeAttributes.
• Adding #.updateEdgeAttributes.
• Adding #.getSourceAttribute, #.getTargetAttribute, #.getOppositeAttribute and friends.
• Aligning #.updateEachEdgeAttributes callback arguments to #.forEachEdge.
• Improving #.merge* and #.update* function by returning useful information.
• Improving #.opposite performance.

Migration guide

This release should only affect you in the following cases:

1. You were relying on the keys returned by #.mergeEdge, #.updateEdge etc. In which case those methods now return a useful tuple containing said key as its first element as well as additional information about whether target elements already existed in the graph or not.
2. Some hidden adjacency iteration methods were mangled and are still hidden. This could only affect you if you were using #.forEach, #.find or #.adjacency (not to be confused with their node, edge & neighbor counterparts).

0.22.2

• Fixing #.mergeEdge & #.updateEdge error messages.
• Improving performance of #.addEdge etc. (less deopt).
• Improving #.inspect output wrt undirected multi edges.

0.22.1

• Fixing prepublishOnly script and shipped package.

0.22.0

• Rolling back to robust generated ids for edges.
• Adding #.mapNodes, #.filterNodes, #.reduceNodes, #.findNode #.someNode, #.everyNode.
• Adding #.mapEdges, #.filterEdges, #.reduceEdges, #.findEdge #.someEdge, #.everyEdge.
• Adding #.mapNeighbors, #.filterNeighbors, #.reduceNeighbors, #.findNeighbor #.someNeighbor, #.everyNeighbor.
• Adding #.degreeWithoutSelfLoops.
• Changing #.forEach*Until methods to #.find* methods.
• Dropping #.hasGeneratedKey.
• Dropping the generated last argument to edge & adjacency iterations.
• Dropping the edgeKeyGenerator instantiation option.
• Dropping second argument of #.degree.
• Changing #.neighbors(source, target) to #.areNeighbors.
• Changing iterator entries to objects rather than arrays.
• #.exportEdge will now always return a key.
• Fixing mutability bug with #.copy.
• Fixing adjacency iterator items missing undirected.
• Fixing edge iterator items missing undirected.
• Fixing bug related to instance counters and #.clear, #.clearEdges.
• Improving #.copy performance.
• Improving #.areNeighbors performance.
• Improving #.forEachNode performance.
• Upgrading obliterator and improving iterator-based methods.

Migration guide

This release should only affect you in the following use-cases:

1. You were using #.forEach*Until methods, in which case you should replace them by the relevant #.find* or #.some* method.
2. You were using the boolean second argument to the #.degree methods. Replace those calls by #.degreeWithoutSelfLoops.
3. You were using the (well-hidden) two-arguments polymorphism of #.neighbors. Replace those calls by #.areNeighbors.
4. You were using iterators in which case the yielded entries are now objects rather than arrays and should be easier to destructure to access the parts you need.
5. You were doing despicable things with automatically generated keys.

0.21.1

• Fixing #.removeNodeAttribute error message.
• Upgrading types to 0.20.0.

0.21.0

• *Until methods now return whether they broke.
• Fixing a bug with #.forEachNodeUntil.

0.20.0

• Changing default edge key generator to simple incremental id.

0.19.3

• Fixing issues related to rollup bundling.

0.19.2

• Fixing #.dropNode bug.

0.19.1

• Optimizing #.dropNode.