/third_party/boost/boost/graph/ |
D | adjacency_iterator.hpp | 21 struct adjacency_iterator struct 29 super_t; 31 inline adjacency_iterator() {} in adjacency_iterator() function 32 inline adjacency_iterator(OutEdgeIter const& i, const Graph* g) in adjacency_iterator() argument 37 inline Vertex dereference() const { return target(*this->base(), *m_g); } in dereference() 39 const Graph* m_g;
|
D | graph_archetypes.hpp | 59 typedef void adjacency_iterator; typedef 112 typedef input_iterator_archetype< Vertex > adjacency_iterator; typedef 164 typedef typename Adjacency::adjacency_iterator adjacency_iterator; typedef
|
D | vertex_and_edge_range.hpp | 46 typedef void adjacency_iterator; typedef in boost::graph::vertex_and_edge_range
|
D | leda_graph.hpp | 48 class adjacency_iterator class 53 adjacency_iterator( in adjacency_iterator() function in boost::graph_traits::adjacency_iterator 201 class adjacency_iterator class 206 adjacency_iterator(leda::edge edge = 0, const leda::graph* g = 0) in adjacency_iterator() function in boost::graph_traits::adjacency_iterator
|
D | isomorphism.hpp | 245 adjacency_iterator; typedef 259 adjacency_iterator; in match() typedef
|
D | edge_list.hpp | 98 typedef void adjacency_iterator; typedef in boost::edge_list_impl 189 typedef void adjacency_iterator; typedef in boost::edge_list_impl_ra
|
D | reverse_graph.hpp | 187 out_edge_iterator >::type adjacency_iterator; typedef in boost::reverse_graph 393 typename graph_traits< Graph >::adjacency_iterator adjacency_iterator; in adjacent_vertices() typedef
|
D | transitive_closure.hpp | 71 typename graph_traits< Graph >::adjacency_iterator adjacency_iterator; in transitive_closure() typedef
|
D | stanford_graph.hpp | 94 typedef sgb_adj_iterator adjacency_iterator; typedef 112 typedef sgb_adj_iterator adjacency_iterator; typedef
|
D | grid_graph.hpp | 322 adjacency_iterator; typedef in boost::grid_graph 866 typedef typename type::adjacency_iterator adjacency_iterator; in adjacent_vertices() typedef
|
D | filtered_graph.hpp | 192 out_edge_iterator >::type adjacency_iterator; typedef in boost::filtered_graph 408 typedef typename Graph::adjacency_iterator adjacency_iterator; in adjacent_vertices() typedef
|
D | graph_concepts.hpp | 154 typedef typename graph_traits< G >::adjacency_iterator adjacency_iterator; typedef
|
D | labeled_graph.hpp | 321 adjacency_iterator; typedef in boost::labeled_graph 526 adjacency_iterator; typedef in boost::labeled_graph
|
D | vector_as_graph.hpp | 67 typedef typename EdgeList::const_iterator adjacency_iterator; typedef
|
D | directed_graph.hpp | 82 typedef typename graph_type::adjacency_iterator adjacency_iterator; typedef in boost::directed_graph
|
D | undirected_graph.hpp | 82 typedef typename graph_type::adjacency_iterator adjacency_iterator; typedef in boost::undirected_graph
|
D | compressed_sparse_row_graph.hpp | 279 typedef typename std::vector< Vertex >::const_iterator adjacency_iterator; typedef in boost::compressed_sparse_row_graph 877 typedef typename std::vector< Vertex >::const_iterator adjacency_iterator; typedef in boost::compressed_sparse_row_graph
|
D | adjacency_matrix.hpp | 543 out_edge_iterator >::type adjacency_iterator; typedef in boost::adjacency_matrix 842 typedef typename Graph::adjacency_iterator adjacency_iterator; in adjacent_vertices() typedef
|
D | subgraph.hpp | 100 typedef typename Traits::adjacency_iterator adjacency_iterator; typedef in boost::subgraph
|
/third_party/boost/libs/graph/example/ |
D | implicit_graph.cpp | 140 typedef ring_adjacency_iterator adjacency_iterator; typedef in ring_graph 169 adjacency_iterator; typedef
|
D | knights_tour.cpp | 64 typedef knight_adjacency_iterator adjacency_iterator; typedef
|
/third_party/boost/boost/mpi/ |
D | graph_communicator.hpp | 547 typedef mpi::detail::comm_adj_iterator adjacency_iterator; typedef
|
/third_party/boost/libs/graph/test/ |
D | betweenness_centrality_test.cpp | 272 adjacency_iterator; in simple_unweighted_betweenness_centrality() typedef
|
/third_party/boost/boost/graph/distributed/ |
D | connected_components.hpp | 298 adjacency_iterator; in parallel_connected_components() typedef
|
D | strong_components.hpp | 239 typedef typename graph_traits<Graph>::adjacency_iterator adjacency_iterator; in fleischer_hendrickson_pinar_strong_components() typedef
|