Function
Static Public Summary | ||
public |
addDefaultWeight(edges: *) |
|
public |
blossom(CHECK_OPTIMUM: *, CHECK_DELTA: *): * |
|
public |
* blossomEdges(nvertex: *, blossomchilds: *, neighbend: *, bv: *) |
|
public |
* blossomLeaves(nvertex: *, nodes: *, b: *) Generate the leaf vertices of a blossom via depth-first search. |
|
public |
checkDelta2(objectPattern: {"nvertex": *, "neighbend": *, "label": *, "endpoint": *, "bestedge": *, "slack": *, "inblossom": *}) |
|
public |
checkDelta3(objectPattern: {"nvertex": *, "edges": *, "blossomparent": *, "blossomchilds": *, "neighbend": *, "label": *, "endpoint": *, "bestedge": *, "slack": *, "inblossom": *}) |
|
public |
endpoints(nedge: *, edges: *): * |
|
public |
general(edges: *) |
|
public |
general(edges: *) |
|
public |
generalApprox(edges: *, _eps: *) |
|
public |
generalApprox(edges: *, _eps: *) |
|
public |
* iter(matching: *) |
|
public |
min(a: *, i: *, j: *): * |
|
public |
neighbours(nvertex: *, nedge: *, edges: *): * |
|
public |
rotate(a: *, n: *) |
|
public |
statistics(edges: *): undefined[] |
|
public |
verifyOptimum(objectPattern: {"nvertex": *, "edges": *, "maxCardinality": *, "nedge": *, "blossomparent": *, "mate": *, "endpoint": *, "dualvar": *, "blossombase": *, "blossomendps": *}) |
Static Public
public addDefaultWeight(edges: *) source
import addDefaultWeight from '@graph-algorithm/maximum-matching/src/addDefaultWeight.js'
Params:
Name | Type | Attribute | Description |
edges | * |
public blossom(CHECK_OPTIMUM: *, CHECK_DELTA: *): * source
import blossom from '@graph-algorithm/maximum-matching/src/core/blossom/blossom.js'
Params:
Name | Type | Attribute | Description |
CHECK_OPTIMUM | * | ||
CHECK_DELTA | * |
Return:
* |
public * blossomEdges(nvertex: *, blossomchilds: *, neighbend: *, bv: *) source
import blossomEdges from '@graph-algorithm/maximum-matching/src/core/blossom/blossomEdges.js'
Params:
Name | Type | Attribute | Description |
nvertex | * | ||
blossomchilds | * | ||
neighbend | * | ||
bv | * |
public * blossomLeaves(nvertex: *, nodes: *, b: *) source
import blossomLeaves from '@graph-algorithm/maximum-matching/src/core/blossom/blossomLeaves.js'
Generate the leaf vertices of a blossom via depth-first search.
Params:
Name | Type | Attribute | Description |
nvertex | * | ||
nodes | * | ||
b | * |
public checkDelta2(objectPattern: {"nvertex": *, "neighbend": *, "label": *, "endpoint": *, "bestedge": *, "slack": *, "inblossom": *}) source
import checkDelta2 from '@graph-algorithm/maximum-matching/src/core/blossom/checkDelta2.js'
Params:
Name | Type | Attribute | Description |
objectPattern | {"nvertex": *, "neighbend": *, "label": *, "endpoint": *, "bestedge": *, "slack": *, "inblossom": *} |
|
public checkDelta3(objectPattern: {"nvertex": *, "edges": *, "blossomparent": *, "blossomchilds": *, "neighbend": *, "label": *, "endpoint": *, "bestedge": *, "slack": *, "inblossom": *}) source
import checkDelta3 from '@graph-algorithm/maximum-matching/src/core/blossom/checkDelta3.js'
Params:
Name | Type | Attribute | Description |
objectPattern | {"nvertex": *, "edges": *, "blossomparent": *, "blossomchilds": *, "neighbend": *, "label": *, "endpoint": *, "bestedge": *, "slack": *, "inblossom": *} |
|
public endpoints(nedge: *, edges: *): * source
import endpoints from '@graph-algorithm/maximum-matching/src/core/blossom/endpoints.js'
Params:
Name | Type | Attribute | Description |
nedge | * | ||
edges | * |
Return:
* |
public general(edges: *) source
import general from '@graph-algorithm/maximum-matching/src/cardinality/opt/general.js'
Params:
Name | Type | Attribute | Description |
edges | * |
public general(edges: *) source
import general from '@graph-algorithm/maximum-matching/src/weight/opt/general.js'
Params:
Name | Type | Attribute | Description |
edges | * |
public generalApprox(edges: *, _eps: *) source
import generalApprox from '@graph-algorithm/maximum-matching/src/cardinality/approx/general.js'
Params:
Name | Type | Attribute | Description |
edges | * | ||
_eps | * |
public generalApprox(edges: *, _eps: *) source
import generalApprox from '@graph-algorithm/maximum-matching/src/weight/approx/general.js'
Params:
Name | Type | Attribute | Description |
edges | * | ||
_eps | * |
public * iter(matching: *) source
import iter from '@graph-algorithm/maximum-matching/src/iter.js'
Params:
Name | Type | Attribute | Description |
matching | * |
public min(a: *, i: *, j: *): * source
import min from '@graph-algorithm/maximum-matching/src/core/blossom/min.js'
Params:
Name | Type | Attribute | Description |
a | * | ||
i | * | ||
j | * |
Return:
* |
public neighbours(nvertex: *, nedge: *, edges: *): * source
import neighbours from '@graph-algorithm/maximum-matching/src/core/blossom/neighbours.js'
Params:
Name | Type | Attribute | Description |
nvertex | * | ||
nedge | * | ||
edges | * |
Return:
* |
public rotate(a: *, n: *) source
import rotate from '@graph-algorithm/maximum-matching/src/core/blossom/rotate.js'
Params:
Name | Type | Attribute | Description |
a | * | ||
n | * |
public statistics(edges: *): undefined[] source
import statistics from '@graph-algorithm/maximum-matching/src/core/blossom/statistics.js'
Params:
Name | Type | Attribute | Description |
edges | * |
public verifyOptimum(objectPattern: {"nvertex": *, "edges": *, "maxCardinality": *, "nedge": *, "blossomparent": *, "mate": *, "endpoint": *, "dualvar": *, "blossombase": *, "blossomendps": *}) source
import verifyOptimum from '@graph-algorithm/maximum-matching/src/core/blossom/verifyOptimum.js'
Params:
Name | Type | Attribute | Description |
objectPattern | {"nvertex": *, "edges": *, "maxCardinality": *, "nedge": *, "blossomparent": *, "mate": *, "endpoint": *, "dualvar": *, "blossombase": *, "blossomendps": *} |
|