28 #include "fully_connected.h"
30 namespace pagmo {
namespace topology {
42 for (std::pair<v_iterator,v_iterator> vertices =
get_vertices(); vertices.first != vertices.second; ++vertices.first) {
44 if (n != *vertices.first) {
53 return "Fully connected";
boost::shared_ptr< base > base_ptr
Alias for shared pointer to base topology.
fully_connected()
Default constructor.
graph_type::vertices_size_type vertices_size_type
Vertices size type.
base_ptr clone() const
Clone method.
void add_edge(const vertices_size_type &, const vertices_size_type &)
Add an edge.
std::string get_name() const
Get name of the topology.
void connect(const vertices_size_type &)
Establish connections between islands during a push_back() operation.
Fully-connected topology.
std::pair< v_iterator, v_iterator > get_vertices() const
Return iterator range to vertices.