Searched refs:edge_iter (Results 1 – 9 of 9) sorted by relevance
| /third_party/boost/libs/graph/example/ |
| D | edge_iterator_constructor.cpp | 104 edge_stream_iterator edge_iter(f), end; in main() local
108 while (edge_iter != end) in main()
111 boost::tie(i, j) = *edge_iter++; in main()
115 IteratorConstructibleGraph G(edge_iter, end, size_V); in main()
|
| /third_party/boost/libs/graph/test/ |
| D | bipartite_test.cpp | 24 typename traits::edge_iterator edge_iter, edge_end; in check_two_coloring() local
26 for (boost::tie(edge_iter, edge_end) = boost::edges(g); in check_two_coloring()
27 edge_iter != edge_end; ++edge_iter) in check_two_coloring()
30 source = boost::source(*edge_iter, g); in check_two_coloring()
31 target = boost::target(*edge_iter, g); in check_two_coloring()
|
| D | graph_test.hpp | 79 std::pair< vertex_t, vertex_t > >::const_iterator edge_iter; in test_incidence_graph() typedef
86 for (edge_iter e = edge_set.begin(); e != edge_set.end(); ++e) in test_incidence_graph()
109 std::pair< vertex_t, vertex_t > >::const_iterator edge_iter; in test_bidirectional_graph() typedef
116 for (edge_iter e = edge_set.begin(); e != edge_set.end(); ++e) in test_bidirectional_graph()
139 std::pair< vertex_t, vertex_t > >::const_iterator edge_iter; in test_adjacency_graph() typedef
146 for (edge_iter e = edge_set.begin(); e != edge_set.end(); ++e) in test_adjacency_graph()
|
| /third_party/boost/boost/graph/distributed/ |
| D | connected_components.hpp | 156 ::iterator edge_iter = edges.begin(); in build_local_metagraph() local
157 for ( ; edge_iter != edges.end(); ++edge_iter) in build_local_metagraph()
158 add_edge(vertex_map[edge_iter->first], vertex_map[edge_iter->second], mg); in build_local_metagraph()
|
| /third_party/boost/boost/graph/ |
| D | isomorphism.hpp | 66 typedef typename std::vector< edge1_t >::iterator edge_iter; typedef in boost::detail::isomorphism_algo
247 edge_iter iter;
251 bool match(edge_iter iter, int dfs_num_k) in match()
|
| /third_party/boost/libs/graph/doc/ |
| D | isomorphism-impl.w | 652 EdgeIter edge_iter, EdgeIter edge_iter_end,
721 for (; edge_iter != edge_iter_end; ++edge_iter) {
722 if (get(index_map1, k) != edge_order(*edge_iter, index_map1, g1))
724 if (k == source(*edge_iter, g1)) { // (k,j)
743 } // for edge_iter
758 vertex1_t j = target(*edge_iter, g1);
848 vertex1_t j = source(*edge_iter, g1);
955 if (isomorph(boost::next(k_iter), last, edge_iter, edge_iter_end, g1, g2,
|
| D | isomorphism-impl-v2.w | 158 bool match(edge_iter iter)
637 for (edge_iter e = ordered_edges.begin(); e != ordered_edges.end(); ++e) {
680 for (edge_iter i = next(ordered_edges.begin()); i != ordered_edges.end(); ++i)
720 typedef std::vector<ordered_edge>::iterator edge_iter;
|
| D | isomorphism-impl-v3.w | 292 bool match(edge_iter iter, int dfs_num_k)
781 typedef typename std::vector<edge1_t>::iterator edge_iter;
|
| /third_party/ninja/src/ |
| D | build_test.cc | 633 vector<Edge*>::iterator edge_iter = active_edges_.end() - 1; in WaitForCommand() local
635 Edge* edge = *edge_iter; in WaitForCommand()
649 active_edges_.erase(edge_iter); in WaitForCommand()
683 active_edges_.erase(edge_iter); in WaitForCommand()
|