boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-31 20:22:09 +00:00
Code Issues Projects Releases Wiki Activity

Merge pull request #99 from pavelkryukov/patch-2

Browse Source 
Remove deprecated std::unary_function and std::binary_function from examples
This commit is contained in:
jzmaddock
2018-10-14 08:47:59 +01:00
committed by GitHub
parent 948eb2455a 2f430a19e1
commit 38b65d2afd
3 changed files with 9 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
example/astar_maze.cpp
View File

@@ -46,7 +46,9 @@ typedef boost::graph_traits<grid>::vertex_descriptor vertex_descriptor;
typedef boost::graph_traits<grid>::vertices_size_type vertices_size_type;
// A hash function for vertices.
struct vertex_hash:std::unary_function<vertex_descriptor, std::size_t> {
struct vertex_hash {
typedef vertex_descriptor argument_type;
typedef std::size_t result_type;
std::size_t operator()(vertex_descriptor const& u) const {
std::size_t seed = 0;
boost::hash_combine(seed, u[0]);

4
example/gerdemann.cpp
View File

@@ -63,8 +63,10 @@ void merge_vertex
template <class StoredEdge>
struct order_by_name
: public std::binary_function<StoredEdge,StoredEdge,bool>
{
typedef StoredEdge first_argument_type;
typedef StoredEdge second_argument_type;
typedef bool result_type;
bool operator()(const StoredEdge& e1, const StoredEdge& e2) const {
// Using std::pair operator< as an easy way to get lexicographical
// compare over tuples.

4
example/ordered_out_edges.cpp
View File

@@ -32,8 +32,10 @@
template <class StoredEdge>
struct order_by_name
: public std::binary_function<StoredEdge,StoredEdge,bool>
{
typedef StoredEdge first_argument_type;
typedef StoredEdge second_argument_type;
typedef bool result_type;
bool operator()(const StoredEdge& e1, const StoredEdge& e2) const {
// Order by target vertex, then by name.
// std::pair's operator< does a nice job of implementing