Nehany folyamalgoritmus futasi ideje, azzal a kozponti kerdessel, hogy a sok dereferalas
hasznalata/kerulese
optimalizalassal/optimalizalas nelkul
kulonbozo gepeken Celeron 600/karp
milyen futasi idoket eredmenyez.
1 #ifndef VECTOR_EDGE_MAP_H
2 #define VECTOR_EDGE_MAP_H
6 #include "edge_map_base.h"
8 template <typename G, typename E, typename V>
9 class VectorEdgeMap : public EdgeMapBase<G, E>{
13 VectorEdgeMap(Graph& g) : EdgeMapBase<G, E>(g) {}
15 void add(const E& edge) {
16 if (edge->id >= container.size()) {
17 container.resize(edge->id);
21 void erase(const E&) {}
24 typedef vector<ValueType> Container;