#include <vector>
#include <map>
#include <iostream>
Go to the source code of this file.
Classes | |
class | graph< N, E >::const_iterator |
class | graph< N, E > |
struct | graph< N, E >::value_type |
struct | graph< N, E >::const_iterator::value_type |
Functions | |
template<typename T > | |
std::ostream & | operator<< (std::ostream &o, const std::vector< std::vector< std::pair< T, T > > > v) |
std::ostream& operator<< | ( | std::ostream & | o, |
const std::vector< std::vector< std::pair< T, T > > > | v | ||
) |
Definition at line 451 of file adjgraph.h.
References connectstrParser::o, and v.
{ typedef typename std::vector<std::vector<std::pair<T,T> > > v_t; typedef typename std::vector<std::pair<T,T> > i_t; typename v_t::const_iterator it(v.begin()), ed(v.end()); for (; it != ed; ++it) { typename i_t::const_iterator iit(it->begin()), ied(it->end()); for(; iit != ied; ++iit) { o << iit->first << ':' << iit->second << std::endl; } } return o; }