graphology-types - npm Package Versions

0.24.1

• Improving performance and memory usage of multigraphs.

0.24.0

• Adding #.inboundDegree, #.outboundDegree, #.inboundDegreeWithoutSelfLoops, #.outboundDegreeWithoutSelfLoops.
• Adding missing #.dropDirectedEdge & #.dropUndirectedEdge.
• Adding possibility to pass upgrading options to #.copy.
• Refactoring internal edge & neighbor iteration schemes.
• Dropping undocumented #.upgradeToMixed & #.upgradeToMulti.
• Refactoring internal indices.
• Fixing edge iteration wrt. self loops.
• Dropping some irrelevant arities for edge attribute updates.
• Improving performance of edge iteration.
• Improving performance of neighbor iteration.
• Improving performance of node deletion.
• Improving performance of edge attribute edition.
• Improving performance of internal edge key generator.
• Improving memory usage.
• Improving performance of default degree methods.
• Improving serialization performance.

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).