本文整理汇总了C++中sgraph::init_edge_field方法的典型用法代码示例。如果您正苦于以下问题：C++ sgraph::init_edge_field方法的具体用法？C++ sgraph::init_edge_field怎么用？C++ sgraph::init_edge_field使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类sgraph的用法示例。
在下文中一共展示了sgraph::init_edge_field方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: triple_apply_kcore
/**
* We start with every vertex having core_id = KMAX,
* Each iteration, while the gather will +1 for neighbors whose core_id > CURRENT_K
* If the gather is > 0 and <= CURRENT_K, then we set the core_id to CURRENT_K (indicate its deleted).
* And repeat...
*/
void triple_apply_kcore(sgraph& g) {
typedef sgraph_compute::sgraph_engine<flexible_type>::graph_data_type graph_data_type;
typedef sgraph::edge_direction edge_direction;
// initialize every vertex with core id kmin
g.init_vertex_field(CORE_ID_COLUMN, KMIN);
g.init_vertex_field(DEGREE_COLUMN, 0);
g.init_vertex_field(DELETED_COLUMN, 0);
g.init_edge_field(DELETED_COLUMN, 0);
// Initialize degree count
sgraph_compute::sgraph_engine<flexible_type> ga;
auto degrees = ga.gather(
g,
[=](const graph_data_type& center,
const graph_data_type& edge,
const graph_data_type& other,
edge_direction edgedir,
flexible_type& combiner) {
combiner += 1;
},
flexible_type(0),
edge_direction::ANY_EDGE);
g.replace_vertex_field(degrees, DEGREE_COLUMN);
// Initialize fields
long vertices_left = g.num_vertices();
std::atomic<long> num_vertices_changed;
const size_t core_idx = g.get_vertex_field_id(CORE_ID_COLUMN);
const size_t degree_idx = g.get_vertex_field_id(DEGREE_COLUMN);
const size_t v_deleted_idx= g.get_vertex_field_id(DELETED_COLUMN);
const size_t e_deleted_idx= g.get_edge_field_id(DELETED_COLUMN);
// Triple apply
sgraph_compute::triple_apply_fn_type apply_fn =
[&](sgraph_compute::edge_scope& scope) {
auto& source = scope.source();
auto& target = scope.target();
auto& edge = scope.edge();
scope.lock_vertices();
// edge is not deleted
if (!edge[e_deleted_idx]) {
// check source degree
if (!source[v_deleted_idx] && source[degree_idx] <= CURRENT_K) {
source[core_idx] = CURRENT_K;
source[v_deleted_idx] = 1;
num_vertices_changed++;
}
// check target degree
if (!target[v_deleted_idx] && target[degree_idx] <= CURRENT_K) {
target[core_idx] = CURRENT_K;
target[v_deleted_idx] = 1;
num_vertices_changed ++;
}
// delete the edge if either side is deleted
if (source[v_deleted_idx] || target[v_deleted_idx]) {
edge[e_deleted_idx] = 1;
--source[degree_idx];
--target[degree_idx];
// We need to check again if the deletion of this edge
// causing either source or target vertex to be deleted.
if (!source[v_deleted_idx] && source[degree_idx] <= CURRENT_K) {
source[core_idx] = CURRENT_K;
source[v_deleted_idx] = 1;
num_vertices_changed++;
}
// check target degree
if (!target[v_deleted_idx] && target[degree_idx] <= CURRENT_K) {
target[core_idx] = CURRENT_K;
target[v_deleted_idx] = 1;
num_vertices_changed++;
}
}
}
scope.unlock_vertices();
};
for (CURRENT_K = KMIN; CURRENT_K < KMAX; ++CURRENT_K) {
while (true) {
if(cppipc::must_cancel()) {
log_and_throw(std::string("Toolkit cancelled by user."));
}
num_vertices_changed = 0;
sgraph_compute::triple_apply(g, apply_fn, {CORE_ID_COLUMN, DEGREE_COLUMN, DELETED_COLUMN}, {DELETED_COLUMN});
if (num_vertices_changed == 0)
break;
vertices_left -= num_vertices_changed;
if (CURRENT_K == 0 || num_vertices_changed == 0 || vertices_left == 0) {
// we are done with the current core.
break;
}
ASSERT_GT(vertices_left, 0);
}
logprogress_stream << "Finish computing core " << CURRENT_K << "\t Vertices left: "
//.........这里部分代码省略.........