Edge Struct Reference

Edge represents the edge of the bipartite graph and is also the key. More...

#include <kdbopmphm.h>

Data Fields
uint32_t	h [3]
int	nextEdge [2]
size_t	order

Detailed Description

Edge represents the edge of the bipartite graph and is also the key.

Only needed for build, number of keys times.

Field Documentation

uint32_t Edge::h[3]

the hash function value of each key

int Edge::nextEdge[2]

the index of the next edge in the edge list of the vertex

size_t Edge::order

the desired index of the key in the opmphm hash map

---

The documentation for this struct was generated from the following file:

• kdbopmphm.h