array_property_map.hpp>
# include
# include
# include _vertex_info_t
{id; color;
}; _edge_info_t
{id;
}; _info_t
{id;
}; boost :: adjacency_list
{= end - start; (diffticks * factor)/CLOCKS_PER_SEC;
} _clock_ms (clock_t start, clock_t end)
{_clock (start, end, 1000);
} _clock_sec (clock_t start, clock_t end)
{_clock (start, end, 1);
} _missing_incident_color (constVertexT & vert, constGraphT & graph)
{:: pair adj_vert = boost :: adjacent_vertices (vert, graph); :: vector present_colors; (autoi = adj_vert.first; i! = adj_vert.second ; + + i)
{color = graph [* i]. color; (color> 0)
{_colors.push_back (color);
}
} (present_colors.size () == 0)
{1;
} :: sort (present_colors.begin (), present_colors.end ()); (present_colors [0]! = 1) 1; (autoi = present_colors.begin (); i! = present_colors . end (); + + i)
{j = i; (+ + j == present_colors.end ())
{* i +1;
} (* j - * i> 1)
{* i +1;
}
} 0;
} _if_all (InputIteratorT first, InputIteratorT last, OutputIteratorT out, PredicateTpred)
{= first; ((i = find_if (i, last, pred))! = last)
* out + + = * i + +;
} _if_all (std :: map :: iterator first, std :: map :: iterator last, OutputIteratorT out, PredicateTpred)
{:: map :: iteratori = first; ((i = find_if (i, last, pred))! = last)
* out + + = (* i + +). first;
} _usage_pred_t
{: _usage_pred_t (size_tusage_cnt)
: m_usage_cnt (usage_cnt)
{} () (constColorUsagePairT & p) const
{(p.second == m_usage_cnt);
}: _tm_usage_cnt;
}; _once_...
