Searched refs:is_directed (Results 1 – 14 of 14) sorted by relevance
| /third_party/boost/boost/graph/ |
| D | graph_selectors.hpp | 26 is_directed = true, enumerator
36 is_directed = false, enumerator
46 is_directed = true, enumerator
|
| D | graph_traits.hpp | 101 inline bool is_directed(directed_tag) { return true; } in is_directed() function
102 inline bool is_directed(undirected_tag) { return false; } in is_directed() function
106 template < typename Graph > bool is_directed(const Graph&) in is_directed() function
109 return detail::is_directed(Cat()); in is_directed()
115 return !is_directed(g); in is_undirected()
|
| D | adjacency_list.hpp | 221 typedef typename DirectedS::is_directed_t is_directed; typedef
224 typename mpl::if_< is_directed, directed_tag,
|
| D | adjacency_matrix.hpp | 407 typedef typename Directed::is_directed_t is_directed; typedef in boost::adjacency_matrix_traits
416 typedef typename mpl::if_< is_directed, bidirectional_tag,
561 : m_matrix(Directed::is_directed ? (n_vertices * n_vertices) in adjacency_matrix()
573 : m_matrix(Directed::is_directed ? (n_vertices * n_vertices) in adjacency_matrix()
590 : m_matrix(Directed::is_directed ? (n_vertices * n_vertices) in adjacency_matrix()
638 if (Directed::is_directed) in get_edge()
650 if (Directed::is_directed) in get_edge()
|
| D | graphml.hpp | 54 virtual bool is_directed() const = 0;
87 bool is_directed() const in is_directed() function in boost::mutate_graph_impl
|
| D | graphviz.hpp | 739 virtual bool is_directed() const = 0;
779 bool is_directed() const in is_directed() function in boost::detail::graph::mutate_graph_impl
905 bool is_directed() const in is_directed() function in boost::detail::graph::mutate_graph_impl
|
| D | graph_utility.hpp | 128 if (is_directed(m_g)) in operator ()()
|
| D | subgraph.hpp | 444 if (is_directed(g)) in add_vertex()
|
| /third_party/boost/libs/graph/src/ |
| D | graphml.cpp | 164 bool is_directed in run() local
167 if (is_directed != m_g.is_directed()) in run()
169 if (is_directed) in run()
|
| D | read_graphviz_new.cpp | 580 bool is_directed = false; in parse_graph() local
590 is_directed = false; in parse_graph()
593 is_directed = true; in parse_graph()
598 r.graph_is_directed = is_directed; // Used to check edges in parse_graph()
1172 str, parsed_file, mg->is_directed()); in read_graphviz_new()
|
| /third_party/boost/libs/graph/test/ |
| D | test_graph.hpp | 114 typename is_directed_unidirectional_graph< Graph >::type is_directed; in test_graph() local
143 test_outdirected_graph(g, verts, is_directed); in test_graph()
|
| D | bfs.cpp | 82 if (boost::is_directed(g)) in non_tree_edge()
|
| /third_party/boost/boost/graph/detail/ |
| D | read_graphviz_spirit.hpp | 295 if (self.graph_.is_directed()) in check_undirected()
301 if (!self.graph_.is_directed()) in check_directed()
|
| /third_party/boost/boost/graph/distributed/ |
| D | adjacency_list.hpp | 1307 typedef typename DirectedS::is_directed_t is_directed; typedef in boost::adjacency_list
|