cpp-taskflow/benchmark/graph_traversal/taskflow.cpp at master · navono/cpp-taskflow · GitHub

Repository navigation

History

52 lines (40 loc) · 1.24 KB

Raw

#include <iostream>

#include <chrono>

#include <taskflow/taskflow.hpp>

#include "levelgraph.hpp"

struct TF {

TF(LevelGraph& graph) {

tasks.resize(graph.level());

for(size_t i=0; i<tasks.size(); ++i) {

tasks[i].resize(graph.length());

}

for(size_t i=0; i<graph.length(); i++){

Node& n = graph.node_at(graph.level()-1, i);

tasks[graph.level()-1][i] = tf.silent_emplace([&](){ n.mark(); });

}

for(int l=graph.level()-2; l>=0 ; l--){

for(size_t i=0; i<graph.length(); i++){

Node& n = graph.node_at(l, i);

tasks[l][i] = tf.silent_emplace([&](){ n.mark();});

for(size_t k=0; k<n._out_edges.size(); k++){

tasks[l][i].precede(tasks[l+1][n._out_edges[k]]);

}

void run() {

tf.wait_for_all();

}

tf::Taskflow tf;

std::vector<std::vector<tf::Task>> tasks;

};

void traverse_level_graph_taskflow(LevelGraph& graph){

TF tf(graph);

tf.run();

}

std::chrono::microseconds measure_time_taskflow(LevelGraph& graph){

auto beg = std::chrono::high_resolution_clock::now();

traverse_level_graph_taskflow(graph);

auto end = std::chrono::high_resolution_clock::now();

return std::chrono::duration_cast<std::chrono::microseconds>(end - beg);

}

cpp-taskflow/benchmark/graph_traversal/taskflow.cpp at master · navono/cpp-taskflow · GitHub

Repository navigation

Expand file tree

Breadcrumbs

taskflow.cpp

Latest commit

History

Breadcrumbs

taskflow.cpp

File metadata and controls