graphology-types
Advanced tools
Changelog
0.24.1
Changelog
0.24.0
#.inboundDegree
, #.outboundDegree
, #.inboundDegreeWithoutSelfLoops
, #.outboundDegreeWithoutSelfLoops
.#.dropDirectedEdge
& #.dropUndirectedEdge
.#.copy
.#.upgradeToMixed
& #.upgradeToMulti
.Changelog
0.23.0
#.updateAttributes
.#.updateNodeAttributes
.#.updateEdgeAttributes
.#.getSourceAttribute
, #.getTargetAttribute
, #.getOppositeAttribute
and friends.#.updateEachEdgeAttributes
callback arguments to #.forEachEdge
.#.merge*
and #.update*
function by returning useful information.#.opposite
performance.Migration guide
This release should only affect you in the following cases:
#.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.#.forEach
, #.find
or #.adjacency
(not to be confused with their node, edge & neighbor counterparts).