bidirectional_label Struct Reference

List of all members.

Public Attributes
vid_t	smaller_one
vid_t	larger_one

---

Detailed Description

Unlike in connected components, we need to ensure that neighbors do not overwrite each others values. This is achieved by keeping two values in an edge. In this struct, smaller_one is the id of the vertex that has smaller id, and larger_one the others. This complexity is due to us ignoring the direction of an edge.

---

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

• example_apps/communitydetection.cpp