Information AboutEdmondss Algorithm |
| CATEGORIES ABOUT EDMONDSS ALGORITHM | |
| graph algorithms | |
|
CONDITIONS Let BV be a vertex bucket and BE be an edge bucket/ Let ''v'' be a vertex and ''e'' be an edge of maximum positive weight that is incident to ''v.'' Ci is a circuit. G0 = (V0,E0) is the original digraph. ''ui'' is a replacement vertex for Ci. EXECUTION 1. 2. 3. if , then go to step 14 4. for some vertex and do ::begin 5.______ 6.______find an edge such that |
|
|