one draw without lifting pen)

Begin- Return iterator to beginning

End- Return iterator to end

for (it=m1.begin(); it!= m1.end(); it++) { cout << it->first << ": " << it->second << endl; } EraseRemoves from the map container either a single element or a range of elements map<string,string>::iterator it; it=mymap.find('b'); mymap.erase (it); // erasing by iterator mymap.erase ('c'); // erasing by key Find Searches the container for an element with a key equivalent to k and returns an iterator to it if found, otherwise it returns an iterator to map::end. cout << "a => " << mymap.find('a')->second << '\n';

Clear

Removes all elements from the map container (which are destroyed), leaving the container with a size of 0.

std::map<char, int> mymap;

mymap['x'] = 100;

mymap.clear();

a. Priority Queue

v. Definition:

The STL priority_queue adapter provides to programmers an interface suitable for as a priority queue. Priority queues, however, allow access to only the item with the highest priority.

vi. C++ realization:

priority_queue<int> pq;

vii. Conditional ordering

viii. Inserting and removing functions.

priority_queue<int> mypq; mypq.push(30); mypq.pop();

1. Graphs

a. Definition

b. Vertex, edge:

A graph G = (V,E) is composed of:

V: set of vertices

E: set of edges connecting the vertices in V

An edge e = (u,v) is a pair of vertices

c. Graphs applications: communication,circuits, mechanical, hydraulic, transportation, software systems,internet, games, social relationship and etc.

d. Undirected, Directed graphs:

A directed graph consists of a set V of vertices or nodes and a set E of edges or arcs. Each edge has a source node and a target node, and the edge can be traversed only from source to target.

In undirected graphs each edge can be traversed in either direction.

e. Complete graphs - a simple graph in which each pair of distinct vertices are adjacent is a complete graph.

f. Adjacent vertices, neighbours:

Two vertices in a graph are adjacent if they form an edge. For example, Anchorage and Corvallis are adjacent, while Anchorage and Denver are not. Adjacent vertices are called neighbours.

g. Isolated vertex