Module: Counts. Start


Problem

6/9

Adjacency List: Beginning (C++)

Problem

Given a directed graph image print an adjacency list for all vertices.
 
 

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Insert the missing code snippets
C++
Write the program below 
#include <iostream>
#include <vector>

using namespace std;
	
int main() {
	int n, m, s, f;
	const int V = 4;
	vector< vector < pair <int, int>>>  adj(V+1);
	adj[1].push_back({ 2,5 });
	// остальные ребра добавьте сами  
for (size_t i = 1; i <= V; i++)
	{
		cout << i << ": ";
		for (auto x : adj[i])
				cout << "-> " << x.first << "("<<x.second<<")";
			cout << "\n";
	}
	return 0;
}

     

Program check result

To check the solution of the problem, you need to register or log in!