boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-26 18:42:12 +00:00
Code Issues Projects Releases Wiki Activity

examples: C++11: Use using instead of typedef

Browse Source
This commit is contained in:
Murray Cumming
2016-05-04 12:40:48 +02:00
committed by Murray Cumming
parent 1cfeb9ad6b
commit 35f6a2dc27
171 changed files with 912 additions and 1011 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
example/bfs-example.cpp
View File

@@ -16,7 +16,7 @@ using namespace boost;
template < typename TimeMap >
class bfs_time_visitor : public default_bfs_visitor
{
typedef typename property_traits< TimeMap >::value_type T;
using T = typename property_traits< TimeMap >::value_type;
public:
bfs_time_visitor(TimeMap tmap, T& t) : m_timemap(tmap), m_time(t) {}
@@ -33,7 +33,7 @@ int main()
{
using namespace boost;
// Select the graph type we wish to use
typedef adjacency_list< vecS, vecS, undirectedS > graph_t;
using graph_t = adjacency_list< vecS, vecS, undirectedS >;
// Set up the vertex IDs and names
enum
{
@@ -49,7 +49,7 @@ int main()
};
const char* name = "rstuvwxy";
// Specify the edges in the graph
typedef std::pair< int, int > E;
using E = std::pair< int, int >;
E edge_array[] = { E(r, s), E(r, v), E(s, w), E(w, r), E(w, t), E(w, x),
E(x, t), E(t, u), E(x, y), E(u, y) };
// Create the graph object
@@ -60,18 +60,17 @@ int main()
for (std::size_t j = 0; j < n_edges; ++j)
add_edge(edge_array[j].first, edge_array[j].second, g);
#else
typedef graph_traits< graph_t >::vertices_size_type v_size_t;
using v_size_t = graph_traits< graph_t >::vertices_size_type;
graph_t g(edge_array, edge_array + n_edges, v_size_t(N));
#endif
// Typedefs
typedef graph_traits< graph_t >::vertices_size_type Size;
using Size = graph_traits< graph_t >::vertices_size_type;
// a vector to hold the discover time property for each vertex
std::vector< Size > dtime(num_vertices(g));
typedef iterator_property_map< std::vector< Size >::iterator,
property_map< graph_t, vertex_index_t >::const_type >
dtime_pm_type;
using dtime_pm_type = iterator_property_map< std::vector< Size >::iterator,
property_map< graph_t, vertex_index_t >::const_type >;
dtime_pm_type dtime_pm(dtime.begin(), get(vertex_index, g));
Size time = 0;