Go to the source code of this file.
◆ anonymous enum
Bipartite matching from the netflow package.
The package is vendored into the image, which its diagnostics establish ("Inconsistent matching between %d(U) and %d(V)" and "matching NOT maximum; augm. path:"). This header declares only the part that Rnd::Mesh::AssignFlatVerts() uses, with the layouts that routine and the four entry points below read and write. The type names are inferred.
Both vertex sets are numbered from 1, and a mate of 0 means unmatched. Capacity of each vertex set, including the unused entry 0.
| Enumerator |
|---|
| NETFLOW_MAX_VERTICES | |
◆ Init_U()
Clear every adjacency list and mate of a graph, and its U count.
- Parameters
-
- Ghidra address:
- NTSC-U/C: 0x005e6508
- Ghidra address:
- PAL: 0x006286f0
◆ Init_V()
Clear every mate of a V set, and its V count.
- Parameters
-
- Ghidra address:
- NTSC-U/C: 0x005e64e8
- Ghidra address:
- PAL: 0x006286d0
◆ AddEdge()
Add an edge from a U vertex to a V vertex.
Prepends the edge to the adjacency list of u. The routine also allocates a second record for the reverse direction, stores u in it, and links it nowhere; side is not read.
- Parameters
-
| u | The U vertex, from 1. |
| v | The V vertex, from 1. |
| graph | The graph that owns u. |
| side | The V set. |
- Ghidra address:
- NTSC-U/C: 0x005e6538
- Ghidra address:
- PAL: 0x00628720
◆ Match()
Find a maximum matching of graph against side.
Seeds a greedy matching, reports its size, and then grows it along augmenting paths. The result is left in the mate members of both sets.
- Parameters
-
| graph | The U set and its edges. |
| side | The V set. |
- Ghidra address:
- NTSC-U/C: 0x00569bf0
- Ghidra address:
- PAL: 0x005aa0b8