Mercurial Hosting > traffic-intelligence

comparison c/Motion.cpp @ 196:aeab0b88c9b6

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
began testing of FeatureGraph
author Nicolas Saunier <nicolas.saunier@polymtl.ca>
date Tue, 20 Dec 2011 00:31:37 -0500
parents 09c7881073f3
children 0a27fa343257
comparison
equal deleted inserted replaced
195:1247e26a8b5e 196:aeab0b88c9b6
215 } 215 }
216 216
217 return featureGroups; 217 return featureGroups;
218 } 218 }
219 219
220 string FeatureGraph::informationString(void) { 220 string FeatureGraph::informationString(void) const {
221 stringstream ss; 221 stringstream ss;
222 ss << num_vertices(graph) << " vertices, " << num_edges(graph) << " edges"; 222 ss << num_vertices(graph) << " vertices, " << num_edges(graph) << " edges";
223 return ss.str(); 223 return ss.str();
224 } 224 }
225
226 int FeatureGraph::getNVertices(void) const { return num_vertices(graph);}
227
228 int FeatureGraph::getNEdges(void) const { return num_edges(graph);}
225 229
226 void FeatureGraph::computeVertexIndex(void) { 230 void FeatureGraph::computeVertexIndex(void) {
227 graph_traits<FeatureGraph::UndirectedGraph>::vertex_iterator vi, vend; 231 graph_traits<FeatureGraph::UndirectedGraph>::vertex_iterator vi, vend;
228 graph_traits<FeatureGraph::UndirectedGraph>::vertices_size_type cnt = 0; 232 graph_traits<FeatureGraph::UndirectedGraph>::vertices_size_type cnt = 0;
229 for(tie(vi,vend) = vertices(graph); vi != vend; ++vi) 233 for(tie(vi,vend) = vertices(graph); vi != vend; ++vi)