Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <map>
- #include <vector>
- #include <iostream>
- #include <stdio.h>
- #include <fstream>
- //Scanf var með vesen svo ég gerði þetta án þess.
- void displayGraph(std::map< int, std::vector<int> > map) {
- // Hér þarf að útfæra útskriftarfallið, sjá verkefnislýsingu
- std::map<int, std::vector<int> >::iterator it;
- for ( it = map.begin(); it != map.end(); it++ ){
- std::cout << it -> first << ": "<< std::flush;
- int l = it -> second.size();
- for(int i = 0; i < l; i++) {
- std::cout << it -> second[i] << " "<< std::flush;
- }
- std::cout << std::endl;;
- }
- }
- int main() {
- // The number of vertices V, the number of edges E
- int V, E;
- // Hér þarf að upphafsstilla tilvik af map klasanum
- std::map<int, std::vector<int> > tinyG;
- std::ifstream infile("tinyDG.txt");
- int v, w;
- infile >> v >> w;
- V = v;
- E = w;
- std::vector< std::vector<int> > item(V, std::vector<int>(0));
- while (infile >> v >> w){ item[v].push_back(w); }
- for(int i = 0 ; i <V; i++) { tinyG.insert(make_pair(i, item[i])); }
- // Hér þarf að kalla á útskriftarfallið
- displayGraph(tinyG);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement