#include "xf_graph_L3.hpp"
event <int> twoHop ( xf::graph::L3::Handle& handle, uint32_t* numPart, uint64_t** pairPart, uint32_t** resPart, xf::graph::Graph <uint32_t, float> g )
twoHop algorithm is implemented.
Parameters:
| handle | Graph library L3 handle |
| numPart | Number of pairs of each part to be counted. |
| pairPart | Source and destination pairs of each part to be counted. |
| resPart | result of each part. The order matches the order of the input pairPart. |
| g | Input, CSR graph of IDs’ type of uint32_t and weights’ type of float |