75 cerr <<
"QUERY STATE";
76 for (
size_t i = 0; i < nodes.size(); ++i) cerr <<
" " << nodes[i];
81 if (nodes.size() == 0) {
84 std::pair<std::string, std::vector<double> > >::const_iterator
87 cout << it->second.first <<
" " << it->first;
88 const vector<double>& values = it->second.second;
89 for (
size_t j = 0; j < values.size(); ++j) cout <<
" " << values[j];
93 for (
size_t i = 0; i < nodes.size(); ++i) {
95 std::pair<std::string, std::vector<double> > >::const_iterator
98 cout << it->second.first <<
" " << it->first;
99 const vector<double>& values = it->second.second;
100 for (
size_t j = 0; j < values.size(); ++j) cout <<
" " << values[j];
bool addEdge(const std::string &tag, int id, int dimension, int v1, int v2, const std::vector< double > &measurement, const std::vector< double > &information)