Home
last modified time | relevance | path

Searched refs:edge_iterator (Results 1 – 25 of 129) sorted by relevance

123456

/third_party/boost/boost/graph/
Dmetis.hpp47 class edge_iterator class in boost::graph::metis_reader
67 friend class edge_iterator;
71 edge_iterator& operator++();
80 edge_iterator(metis_reader* self);
86 friend bool operator==(edge_iterator, edge_iterator);
87 friend bool operator!=(edge_iterator, edge_iterator);
89 friend class edge_iterator;
117 edge_iterator begin();
118 edge_iterator end();
151 friend bool operator==(edge_iterator, edge_iterator);
[all …]
Dedge_list.hpp68 struct edge_iterator struct in boost::edge_list_impl
70 typedef edge_iterator self; argument
76 edge_iterator() {} in edge_iterator() function
77 edge_iterator(EdgeIter iter) : _iter(iter), _i(0) {} in edge_iterator() function
103 std::pair< typename edge_list_impl< G, EI, T, D >::edge_iterator,
104 typename edge_list_impl< G, EI, T, D >::edge_iterator >
108 typedef typename edge_list_impl< G, EI, T, D >::edge_iterator edge_iterator; in edges() typedef
109 return std::make_pair(edge_iterator(g._first), edge_iterator(g._last)); in edges()
186 typedef typename boost::integer_range< edge_id >::iterator edge_iterator; typedef in boost::edge_list_impl_ra
194 std::pair< typename edge_list_impl_ra< G, EI, T, D >::edge_iterator,
[all …]
Dbc_clustering.hpp117 typedef typename graph_traits< MutableGraph >::edge_iterator edge_iterator; in betweenness_centrality_clustering() typedef
134 std::pair< edge_iterator, edge_iterator > edges_iters = edges(g); in betweenness_centrality_clustering()
Dwrite_dimacs.hpp52 typedef typename graph_traits< Graph >::edge_iterator edge_iterator; in write_dimacs_max_flow() typedef
65 edge_iterator ei, e_end; in write_dimacs_max_flow()
Ddirected_graph.hpp79 typedef typename graph_type::edge_iterator edge_iterator; typedef in boost::directed_graph
245 void remove_edge(edge_iterator i) { remove_edge(*i); } in remove_edge()
276 edge_iterator i, end; in renumber_edge_indices()
281 void remove_edge_and_renumber_indices(edge_iterator i) in remove_edge_and_renumber_indices()
283 edge_iterator j = next(i), end = edges(m_graph).second; in remove_edge_and_renumber_indices()
355 edge_iterator i, edge_iterator end, vertices_size_type n) in renumber_edge_indices()
480 inline std::pair< typename DIRECTED_GRAPH::edge_iterator,
481 typename DIRECTED_GRAPH::edge_iterator >
548 typename DIRECTED_GRAPH::edge_iterator i, DIRECTED_GRAPH& g) in remove_edge()
771 typename DIRECTED_GRAPH::edge_iterator i, DIRECTED_GRAPH& g) in remove_edge_and_renumber_indices()
Dundirected_graph.hpp79 typedef typename graph_type::edge_iterator edge_iterator; typedef in boost::undirected_graph
248 void remove_edge(edge_iterator i) { remove_edge(*i); } in remove_edge()
279 edge_iterator i, end; in renumber_edge_indices()
284 void remove_edge_and_renumber_indices(edge_iterator i) in remove_edge_and_renumber_indices()
286 edge_iterator j = next(i), end = edges(m_graph.second); in remove_edge_and_renumber_indices()
358 edge_iterator i, edge_iterator end, edges_size_type n) in renumber_edge_indices()
494 inline std::pair< typename UNDIRECTED_GRAPH::edge_iterator,
495 typename UNDIRECTED_GRAPH::edge_iterator >
564 typename UNDIRECTED_GRAPH::edge_iterator i, UNDIRECTED_GRAPH& g) in remove_edge()
798 typename UNDIRECTED_GRAPH::edge_iterator i, UNDIRECTED_GRAPH& g) in remove_edge_and_renumber_indices()
Diteration_macros.hpp89 for (std::pair< typename boost::graph_traits< GraphType >::edge_iterator, \
90 typename boost::graph_traits< GraphType >::edge_iterator > \
102 for (std::pair< boost::graph_traits< GraphType >::edge_iterator, \
103 boost::graph_traits< GraphType >::edge_iterator > \
Dleda_graph.hpp160 class edge_iterator class
161 : public iterator_facade< edge_iterator, leda::edge,
165 edge_iterator( in edge_iterator() function in boost::graph_traits::edge_iterator
174 bool equal(const edge_iterator& other) const in equal()
309 class edge_iterator class
310 : public iterator_facade< edge_iterator, leda::edge,
314 edge_iterator(leda::edge edge = 0, const leda::graph* g = 0) in edge_iterator() function in boost::graph_traits::edge_iterator
322 bool equal(const edge_iterator& other) const in equal()
382 typename graph_traits< leda::GRAPH< vtype, etype > >::edge_iterator,
383 typename graph_traits< leda::GRAPH< vtype, etype > >::edge_iterator >
[all …]
Dvertex_and_edge_range.hpp40 typedef EdgeIterator edge_iterator; typedef in boost::graph::vertex_and_edge_range
85 edge_iterator first_edge;
86 edge_iterator last_edge;
Dgrid_graph.hpp305 edge_iterator; typedef in boost::grid_graph
889 friend inline std::pair< typename type::edge_iterator,
890 typename type::edge_iterator >
895 typedef typename type::edge_iterator edge_iterator; in edges() typedef
898 edge_iterator(edge_index_iterator(0), edge_function(&graph)), in edges()
899 edge_iterator(edge_index_iterator(graph.num_edges()), in edges()
Dbandwidth.hpp55 typename graph_traits< Graph >::edge_iterator i, end; in bandwidth()
80 typename graph_traits< Graph >::edge_iterator i, end; in edgesum()
Dedge_connectivity.hpp76 typedef typename Traits::edge_iterator edge_iterator; in edge_connectivity() typedef
97 edge_iterator ei, ei_end; in edge_connectivity()
Dgraph_concepts.hpp229 typedef typename graph_traits< G >::edge_iterator edge_iterator; typedef
235 BOOST_CONCEPT_ASSERT((MultiPassInputIterator< edge_iterator >)); in BOOST_CONCEPT_USAGE()
243 (boost::mpl::not_< boost::is_same< edge_iterator, void > >::value)); in BOOST_CONCEPT_USAGE()
261 std::pair< edge_iterator, edge_iterator > p;
/third_party/boost/boost/graph/distributed/
Dconcepts.hpp87 typedef typename graph_traits<G>::edge_iterator edge_iterator; typedef
93 BOOST_CONCEPT_ASSERT(( MultiPassInputIteratorConcept<edge_iterator> )); in constraints()
113 std::pair<edge_iterator,edge_iterator> p;
168 typedef typename graph_traits<G>::edge_iterator edge_iterator;
173 BOOST_CONCEPT_ASSERT((MultiPassInputIterator<edge_iterator>));
193 std::pair<edge_iterator,edge_iterator> p;
/third_party/boost/libs/graph/example/
Dadj_list_ra_edgelist.cpp27 graph_traits< Graph >::edge_iterator edge_iterator; in main() local
30 const graph_traits< Graph >::edge_iterator e = edges(g).first + i; in main()
Dimplicit_graph.cpp147 typedef ring_edge_iterator edge_iterator; typedef in ring_graph
174 typedef boost::graph_traits< ring_graph >::edge_iterator edge_iterator; typedef
368 std::pair< edge_iterator, edge_iterator > edges(const ring_graph& g) in edges()
370 return std::pair< edge_iterator, edge_iterator >( in edges()
520 edge_iterator ei, ei_end; in main()
Dactor_clustering.cpp97 typedef typename graph_traits< Graph >::edge_iterator edge_iterator; in write_pajek_graph() typedef
98 for (edge_iterator e = edges(g).first; e != edges(g).second; ++e) in write_pajek_graph()
Dtwo_graphs_common_spanning_trees.cpp34 typedef boost::graph_traits< Graph >::edge_iterator edge_iterator; typedef
Djohnson-eg.cpp43 graph_traits< Graph >::edge_iterator e, e_end; in main()
76 graph_traits< Graph >::edge_iterator ei, ei_end; in main()
/third_party/boost/libs/graph/test/
Disomorphism.cpp68 typedef typename graph_traits< Graph1 >::edge_iterator edge_iterator; in randomly_permute_graph() typedef
92 for (edge_iterator e = edges(g1).first; e != edges(g1).second; ++e) in randomly_permute_graph()
162 for (graph1::edge_iterator e = edges(g1).first; in test_isomorphism2()
174 for (graph2::edge_iterator e = edges(g2).first; in test_isomorphism2()
224 for (graph1::edge_iterator e = edges(g1).first; in test_isomorphism()
236 for (graph2::edge_iterator e = edges(g2).first; in test_isomorphism()
Dlayout_test.cpp91 typename graph_traits< Graph >::edge_iterator ei, ei_end; in dump_graph_layout()
203 typedef typename graph_traits< Graph >::edge_iterator edge_iterator; in test_cube() typedef
211 edge_iterator ei, ei_end; in test_cube()
275 typedef typename graph_traits< Graph >::edge_iterator edge_iterator; in test_triangular() typedef
283 edge_iterator ei, ei_end; in test_triangular()
349 typedef typename graph_traits< Graph >::edge_iterator edge_iterator; in test_disconnected() typedef
357 edge_iterator ei, ei_end; in test_disconnected()
/third_party/boost/libs/graph_parallel/doc/
DDistributedEdgeListGraph.rst42 |Edge iterator |``graph_traits<G>::edge_iterator`` |Iterates over edges stored |
58 | | |``edge_iterator,`` |providing access to the local …
59 | | |``edge_iterator>`` |edges in the graph. …
Dmetis.rst47 class edge_iterator;
52 edge_iterator begin();
53 edge_iterator end();
96 metis_reader::edge_iterator
128 edge_iterator begin();
136 edge_iterator end();
/third_party/boost/boost/graph/detail/
Dadjacency_list.hpp602 inline std::pair< typename Config::edge_iterator,
603 typename Config::edge_iterator >
607 typedef typename Config::edge_iterator edge_iterator; in edges() typedef
610 return std::make_pair(edge_iterator(g.vertex_set().begin(), in edges()
612 edge_iterator(g.vertex_set().begin(), g.vertex_set().end(), in edges()
1005 typename Config::edge_iterator ei, ei_end, next; in remove_edge_if()
1017 inline std::pair< typename Config::edge_iterator,
1018 typename Config::edge_iterator >
1022 typedef typename Config::edge_iterator edge_iterator; in edges() typedef
1026 edge_iterator(g.m_edges.begin()), edge_iterator(g.m_edges.end())); in edges()
[all …]
/third_party/boost/boost/polygon/
Dvoronoi_diagram.hpp444 edge_iterator last_edge = edges_.begin(); in _build()
445 for (edge_iterator it = edges_.begin(); it != edges_.end(); it += 2) { in _build()
471 for (edge_iterator it = edges_.begin(); it != edges_.end(); ++it) { in _build()
500 edge_iterator edge_it = edges_.begin(); in _build()
555 typedef typename edge_container_type::iterator edge_iterator; typedef in boost::polygon::voronoi_diagram

123456