| Public Variable |
Short Description |
|
PMaxWeightMatchingImpl (clj)
|
|
|
act-on-minimum-delta (clj)
|
|
|
add-blossom (clj)
|
Construct a new blossom with given `base`, containing edge k which connects a pair of S vertices. |
|
assign-label (clj)
|
Assign label `t` to the top-level blossom containing vertex `w`, and record the fact that w was reached through the edge with remote enpoint `p`. |
|
augment-blossom (clj)
|
Swap matched/unmatched edges over an alternating path through blossom `b` between vertex `v` and the base vertex. |
|
augment-blossom-step (clj)
|
|
|
augment-matching (clj)
|
Swap matched/unmatched edges over an alternating path between two single vertices. |
|
blossom-loop-direction (clj)
|
|
|
calc-slack (clj)
|
Returns a map with keys kslack and context. |
|
consider-loose-edge-to-free-vertex (clj)
|
w is a free vertex (or an unreached vertex inside a T-blossom) but we can not reach it yet; keep track of the least-slack edge that reaches w. |
|
consider-loose-edge-to-s-blossom (clj)
|
keep track of the least-slack non-allowable edge to a different S-blossom. |
|
consider-tight-edge (clj)
|
|
|
entry-child (clj)
|
|
|
expand-blossom (clj)
|
Expand the given top-level blossom. |
|
expand-tight-sblossoms (clj)
|
|
|
find-augmenting-path (clj)
|
|
|
find-parent-blossoms (clj)
|
|
|
first-labeled-blossom-leaf (clj)
|
|
|
immediate-subblossom-of (clj)
|
Starting from a vertex `v`, ascend the blossom tree, and return the sub-blossom immediately below `b`. |
|
initialize-context (clj)
|
|
|
initialize-stage (clj)
|
|
|
match-endpoint (clj)
|
Add endpoint p's edge to the matching. |
|
mate-endps-to-vertices (clj)
|
Transform mate[] such that mate[v] is the vertex to which v is paired. |
|
max-weight-matching (clj)
|
Compute a maximum-weighted matching of G. |
|
max-weight-matching-impl (clj)
|
|
|
move-back-to-entry-child-relabeling (clj)
|
|
|
move-to-base-relabeling (clj)
|
|
|
promote-sub-blossoms-to-top-blossoms (clj)
|
|
|
recycle-blossom (clj)
|
|
|
relabel-base-t-subblossom (clj)
|
|
|
scan-blossom (clj)
|
Trace back from vertices `v` and `w` to discover either a new blossom or an augmenting path. |
|
scan-neighbors (clj)
|
|
|
trace-to-base (clj)
|
|
|
valid-matching? (clj)
|
Check if the matching is symmetric. |
|
verify-optimum (clj)
|
Verify that the optimum solution has been reached. |