Rev | Line | |
---|
[378] | 1 | #include <iostream> |
---|
[595] | 2 | #include <cstdlib> |
---|
[698] | 3 | #include "list_graph.h" |
---|
[378] | 4 | |
---|
| 5 | using namespace std; |
---|
| 6 | using namespace hugo; |
---|
| 7 | |
---|
| 8 | |
---|
| 9 | int main() { |
---|
[627] | 10 | ListGraph g; |
---|
| 11 | for (int i = 0; i < 10; ++i) { |
---|
| 12 | ListGraph::Node node = g.addNode(); |
---|
| 13 | } |
---|
[701] | 14 | ListGraph::NodeMap<int> map(g, 10); |
---|
[627] | 15 | for (int i = 0; i < 10; ++i) { |
---|
| 16 | ListGraph::Node node = g.addNode(); |
---|
| 17 | map[node] = rand()%100; |
---|
| 18 | } |
---|
| 19 | for (ListGraph::NodeIt it(g); g.valid(it); g.next(it)) { |
---|
| 20 | cout << map[it] << endl; |
---|
| 21 | } |
---|
[701] | 22 | ListGraph::NodeMap<int>::iterator pit; |
---|
| 23 | for (pit = map.begin(); pit != map.end(); ++pit) { |
---|
| 24 | cout << g.id(pit->first) << ' ' << pit->second << endl; |
---|
| 25 | } |
---|
[702] | 26 | /* |
---|
[701] | 27 | ListGraph::NodeMap<double> ot_map = map; |
---|
| 28 | for (ListGraph::NodeIt it(g); g.valid(it); g.next(it)) { |
---|
| 29 | ot_map[it] *= 2.1; |
---|
| 30 | cout << ot_map[it] << endl; |
---|
| 31 | } |
---|
| 32 | ot_map = map; |
---|
| 33 | for (ListGraph::NodeIt it(g); g.valid(it); g.next(it)) { |
---|
| 34 | ot_map[it] *= 3.1; |
---|
| 35 | cout << ot_map[it] << endl; |
---|
[702] | 36 | }*/ |
---|
[627] | 37 | return 0; |
---|
[378] | 38 | } |
---|
| 39 | |
---|
Note: See
TracBrowser
for help on using the repository browser.