Home
last modified time | relevance | path

Searched refs:m_num_vertices (Results 1 – 4 of 4) sorted by relevance

/third_party/boost/boost/graph/
Ddirected_graph.hpp95 , m_num_vertices(0) in directed_graph()
104 , m_num_vertices(x.m_num_vertices) in directed_graph()
113 , m_num_vertices(n) in directed_graph()
125 , m_num_vertices(n) in directed_graph()
143 m_num_vertices = g.m_num_vertices; in operator =()
157 vertices_size_type num_vertices() const { return m_num_vertices; } in num_vertices()
164 m_num_vertices++; in make_index()
190 --m_num_vertices; in remove_vertex()
327 m_num_vertices = m_max_vertex_index = 0; in clear()
334 std::swap(m_num_vertices, g.m_num_vertices); in swap()
[all …]
Dundirected_graph.hpp95 , m_num_vertices(0) in undirected_graph()
104 , m_num_vertices(x.m_num_vertices) in undirected_graph()
114 , m_num_vertices(n) in undirected_graph()
127 , m_num_vertices(n) in undirected_graph()
145 m_num_vertices = g.m_num_vertices; in operator =()
158 vertices_size_type num_vertices() const { return m_num_vertices; } in num_vertices()
165 m_num_vertices++; in make_index()
193 --m_num_vertices; in remove_vertex()
330 m_num_vertices = m_max_vertex_index = 0; in clear()
337 std::swap(m_num_vertices, g.m_num_vertices); in swap()
[all …]
Dvertex_and_edge_range.hpp62 , m_num_vertices(n) in vertex_and_edge_range()
77 m_num_vertices = std::distance(first_v, last_v); in vertex_and_edge_range()
84 vertices_size_type m_num_vertices; member in boost::graph::vertex_and_edge_range
103 return g.m_num_vertices; in num_vertices()
Dgrid_graph.hpp435 inline vertices_size_type num_vertices() const { return (m_num_vertices); } in num_vertices()
757 m_num_vertices = std::accumulate(m_dimension_lengths.begin(), in precalculate()
786 vertices_size_type m_num_vertices; member in boost::grid_graph