1 //=======================================================================
2 // Copyright 2001 University of Notre Dame.
3 // Copyright 2006 Trustees of Indiana University
4 // Authors: Jeremy G. Siek and Douglas Gregor <dgregor@cs.indiana.edu>
6 // Distributed under the Boost Software License, Version 1.0. (See
7 // accompanying file LICENSE_1_0.txt or copy at
8 // http://www.boost.org/LICENSE_1_0.txt)
9 //=======================================================================
11 #ifndef BOOST_ADJACENCY_MATRIX_HPP
12 #define BOOST_ADJACENCY_MATRIX_HPP
14 #include <boost/config.hpp>
17 #include <boost/assert.hpp>
18 #include <boost/limits.hpp>
19 #include <boost/iterator.hpp>
20 #include <boost/graph/graph_traits.hpp>
21 #include <boost/graph/graph_mutability_traits.hpp>
22 #include <boost/graph/graph_selectors.hpp>
23 #include <boost/mpl/if.hpp>
24 #include <boost/mpl/bool.hpp>
25 #include <boost/graph/adjacency_iterator.hpp>
26 #include <boost/graph/detail/edge.hpp>
27 #include <boost/iterator/iterator_adaptor.hpp>
28 #include <boost/iterator/filter_iterator.hpp>
29 #include <boost/range/irange.hpp>
30 #include <boost/graph/properties.hpp>
31 #include <boost/tuple/tuple.hpp>
32 #include <boost/static_assert.hpp>
33 #include <boost/type_traits.hpp>
34 #include <boost/property_map/property_map.hpp>
35 #include <boost/property_map/transform_value_property_map.hpp>
36 #include <boost/property_map/function_property_map.hpp>
42 template <class Directed, class Vertex>
43 class matrix_edge_desc_impl : public edge_desc_impl<Directed,Vertex>
45 typedef edge_desc_impl<Directed,Vertex> Base;
47 matrix_edge_desc_impl() { }
48 matrix_edge_desc_impl(bool exists, Vertex s, Vertex d,
50 : Base(s, d, ep), m_exists(exists) { }
51 bool exists() const { return m_exists; }
56 struct does_edge_exist {
58 bool operator()(const Edge& e) const { return e.exists(); }
61 // Note to self... The int for get_edge_exists and set_edge exist helps
62 // make these calls unambiguous.
63 template <typename EdgeProperty>
64 bool get_edge_exists(const std::pair<bool, EdgeProperty>& stored_edge, int) {
65 return stored_edge.first;
67 template <typename EdgeProperty>
69 std::pair<bool, EdgeProperty>& stored_edge,
73 stored_edge.first = flag;
76 template <typename EdgeProxy>
77 bool get_edge_exists(const EdgeProxy& edge_proxy, ...) {
80 template <typename EdgeProxy>
81 EdgeProxy& set_edge_exists(EdgeProxy& edge_proxy, bool flag, ...) {
83 return edge_proxy; // just to avoid never used warning
87 // NOTE: These functions collide with the get_property function for
88 // accessing bundled graph properties. Be excplicit when using them.
89 template <typename EdgeProperty>
91 get_edge_property(const std::pair<bool, EdgeProperty>& stored_edge) {
92 return stored_edge.second;
94 template <typename EdgeProperty>
96 get_edge_property(std::pair<bool, EdgeProperty>& stored_edge) {
97 return stored_edge.second;
100 template <typename StoredEdgeProperty, typename EdgeProperty>
102 set_edge_property(std::pair<bool, StoredEdgeProperty>& stored_edge,
103 const EdgeProperty& ep, int) {
104 stored_edge.second = ep;
107 inline const no_property& get_edge_property(const char&) {
108 static no_property s_prop;
111 inline no_property& get_edge_property(char&) {
112 static no_property s_prop;
115 template <typename EdgeProxy, typename EdgeProperty>
116 inline void set_edge_property(EdgeProxy, const EdgeProperty&, ...) {}
118 //=======================================================================
119 // Directed Out Edge Iterator
122 typename VertexDescriptor, typename MatrixIter
123 , typename VerticesSizeType, typename EdgeDescriptor
125 struct dir_adj_matrix_out_edge_iter
127 dir_adj_matrix_out_edge_iter<VertexDescriptor, MatrixIter, VerticesSizeType, EdgeDescriptor>
135 typedef iterator_adaptor<
136 dir_adj_matrix_out_edge_iter<VertexDescriptor, MatrixIter, VerticesSizeType, EdgeDescriptor>
144 dir_adj_matrix_out_edge_iter() { }
146 dir_adj_matrix_out_edge_iter(
148 , const VertexDescriptor& src
149 , const VerticesSizeType& n
151 : super_t(i), m_src(src), m_targ(0), m_n(n)
155 ++this->base_reference();
159 inline EdgeDescriptor
162 return EdgeDescriptor(get_edge_exists(*this->base(), 0),
164 &get_edge_property(*this->base()));
166 VertexDescriptor m_src, m_targ;
167 VerticesSizeType m_n;
170 //=======================================================================
171 // Directed In Edge Iterator
174 typename VertexDescriptor, typename MatrixIter
175 , typename VerticesSizeType, typename EdgeDescriptor
177 struct dir_adj_matrix_in_edge_iter
179 dir_adj_matrix_in_edge_iter<VertexDescriptor, MatrixIter, VerticesSizeType, EdgeDescriptor>
187 typedef iterator_adaptor<
188 dir_adj_matrix_in_edge_iter<VertexDescriptor, MatrixIter, VerticesSizeType, EdgeDescriptor>
196 dir_adj_matrix_in_edge_iter() { }
198 dir_adj_matrix_in_edge_iter(
200 , const MatrixIter& last
201 , const VertexDescriptor& tgt
202 , const VerticesSizeType& n
204 : super_t(i), m_last(last), m_src(0), m_targ(tgt), m_n(n)
208 if (VerticesSizeType(m_last - this->base_reference()) >= m_n) {
209 this->base_reference() += m_n;
212 this->base_reference() = m_last;
216 inline EdgeDescriptor
219 return EdgeDescriptor(get_edge_exists(*this->base(), 0),
221 &get_edge_property(*this->base()));
224 VertexDescriptor m_src, m_targ;
225 VerticesSizeType m_n;
228 //=======================================================================
229 // Undirected Out Edge Iterator
232 typename VertexDescriptor, typename MatrixIter
233 , typename VerticesSizeType, typename EdgeDescriptor
235 struct undir_adj_matrix_out_edge_iter
237 undir_adj_matrix_out_edge_iter<VertexDescriptor, MatrixIter, VerticesSizeType, EdgeDescriptor>
245 typedef iterator_adaptor<
246 undir_adj_matrix_out_edge_iter<VertexDescriptor, MatrixIter, VerticesSizeType, EdgeDescriptor>
254 undir_adj_matrix_out_edge_iter() { }
256 undir_adj_matrix_out_edge_iter(
258 , const VertexDescriptor& src
259 , const VerticesSizeType& n
261 : super_t(i), m_src(src), m_inc(src), m_targ(0), m_n(n)
266 if (m_targ < m_src) // first half
268 ++this->base_reference();
270 else if (m_targ < m_n - 1)
273 this->base_reference() += m_inc;
277 this->base_reference() += m_n - m_src;
282 inline EdgeDescriptor
285 return EdgeDescriptor(get_edge_exists(*this->base(), 0),
287 &get_edge_property(*this->base()));
290 VertexDescriptor m_src, m_inc, m_targ;
291 VerticesSizeType m_n;
294 //=======================================================================
295 // Undirected In Edge Iterator
298 typename VertexDescriptor, typename MatrixIter
299 , typename VerticesSizeType, typename EdgeDescriptor
301 struct undir_adj_matrix_in_edge_iter
303 undir_adj_matrix_in_edge_iter<VertexDescriptor, MatrixIter, VerticesSizeType, EdgeDescriptor>
311 typedef iterator_adaptor<
312 undir_adj_matrix_in_edge_iter<VertexDescriptor, MatrixIter, VerticesSizeType, EdgeDescriptor>
320 undir_adj_matrix_in_edge_iter() { }
322 undir_adj_matrix_in_edge_iter(
324 , const VertexDescriptor& src
325 , const VerticesSizeType& n
327 : super_t(i), m_src(src), m_inc(src), m_targ(0), m_n(n)
332 if (m_targ < m_src) // first half
334 ++this->base_reference();
336 else if (m_targ < m_n - 1)
339 this->base_reference() += m_inc;
343 this->base_reference() += m_n - m_src;
348 inline EdgeDescriptor
351 return EdgeDescriptor(get_edge_exists(*this->base(), 0),
353 &get_edge_property(*this->base()));
356 VertexDescriptor m_src, m_inc, m_targ;
357 VerticesSizeType m_n;
360 //=======================================================================
363 template <typename Directed, typename MatrixIter,
364 typename VerticesSizeType, typename EdgeDescriptor>
365 struct adj_matrix_edge_iter
367 adj_matrix_edge_iter<Directed, MatrixIter, VerticesSizeType, EdgeDescriptor>
375 typedef iterator_adaptor<
376 adj_matrix_edge_iter<Directed, MatrixIter, VerticesSizeType, EdgeDescriptor>
384 adj_matrix_edge_iter() { }
386 adj_matrix_edge_iter(const MatrixIter& i, const MatrixIter& start, const VerticesSizeType& n)
387 : super_t(i), m_start(start), m_src(0), m_targ(0), m_n(n) { }
391 increment_dispatch(this->base_reference(), Directed());
394 void increment_dispatch(MatrixIter& i, directedS)
397 if (m_targ == m_n - 1)
408 void increment_dispatch(MatrixIter& i, undirectedS)
422 inline EdgeDescriptor
425 return EdgeDescriptor(get_edge_exists(*this->base(), 0),
427 &get_edge_property(*this->base()));
431 VerticesSizeType m_src, m_targ, m_n;
434 } // namespace detail
436 //=========================================================================
437 // Adjacency Matrix Traits
438 template <typename Directed = directedS>
439 class adjacency_matrix_traits {
440 typedef typename Directed::is_directed_t is_directed;
442 // The bidirectionalS tag is not allowed with the adjacency_matrix
443 // graph type. Instead, use directedS, which also provides the
444 // functionality required for a Bidirectional Graph (in_edges,
446 BOOST_STATIC_ASSERT(!(is_same<Directed, bidirectionalS>::value));
448 typedef typename mpl::if_<is_directed,
449 bidirectional_tag, undirected_tag>::type
452 typedef disallow_parallel_edge_tag edge_parallel_category;
454 typedef std::size_t vertex_descriptor;
456 typedef detail::matrix_edge_desc_impl<directed_category,
457 vertex_descriptor> edge_descriptor;
460 struct adjacency_matrix_class_tag { };
462 struct adj_matrix_traversal_tag :
463 public virtual adjacency_matrix_tag,
464 public virtual vertex_list_graph_tag,
465 public virtual incidence_graph_tag,
466 public virtual adjacency_graph_tag,
467 public virtual edge_list_graph_tag { };
469 //=========================================================================
470 // Adjacency Matrix Class
471 template <typename Directed = directedS,
472 typename VertexProperty = no_property,
473 typename EdgeProperty = no_property,
474 typename GraphProperty = no_property,
475 typename Allocator = std::allocator<bool> >
476 class adjacency_matrix {
477 typedef adjacency_matrix self;
478 typedef adjacency_matrix_traits<Directed> Traits;
481 // The bidirectionalS tag is not allowed with the adjacency_matrix
482 // graph type. Instead, use directedS, which also provides the
483 // functionality required for a Bidirectional Graph (in_edges,
485 BOOST_STATIC_ASSERT(!(is_same<Directed, bidirectionalS>::value));
487 typedef GraphProperty graph_property_type;
488 typedef typename lookup_one_property<GraphProperty, graph_bundle_t>::type graph_bundled;
490 typedef VertexProperty vertex_property_type;
491 typedef typename lookup_one_property<VertexProperty, vertex_bundle_t>::type vertex_bundled;
493 typedef EdgeProperty edge_property_type;
494 typedef typename lookup_one_property<EdgeProperty, edge_bundle_t>::type edge_bundled;
496 public: // should be private
497 typedef typename mpl::if_<typename has_property<edge_property_type>::type,
498 std::pair<bool, edge_property_type>, char>::type StoredEdge;
499 #if defined(BOOST_NO_STD_ALLOCATOR)
500 typedef std::vector<StoredEdge> Matrix;
502 typedef typename Allocator::template rebind<StoredEdge>::other Alloc;
503 typedef std::vector<StoredEdge, Alloc> Matrix;
505 typedef typename Matrix::iterator MatrixIter;
506 typedef typename Matrix::size_type size_type;
508 // Graph concept required types
509 typedef typename Traits::vertex_descriptor vertex_descriptor;
510 typedef typename Traits::edge_descriptor edge_descriptor;
511 typedef typename Traits::directed_category directed_category;
512 typedef typename Traits::edge_parallel_category edge_parallel_category;
513 typedef adj_matrix_traversal_tag traversal_category;
515 static vertex_descriptor null_vertex()
517 return (std::numeric_limits<vertex_descriptor>::max)();
520 //private: if friends worked, these would be private
522 typedef detail::dir_adj_matrix_out_edge_iter<
523 vertex_descriptor, MatrixIter, size_type, edge_descriptor
526 typedef detail::undir_adj_matrix_out_edge_iter<
527 vertex_descriptor, MatrixIter, size_type, edge_descriptor
530 typedef typename mpl::if_<
531 typename Directed::is_directed_t, DirOutEdgeIter, UnDirOutEdgeIter
532 >::type unfiltered_out_edge_iter;
534 typedef detail::dir_adj_matrix_in_edge_iter<
535 vertex_descriptor, MatrixIter, size_type, edge_descriptor
538 typedef detail::undir_adj_matrix_in_edge_iter<
539 vertex_descriptor, MatrixIter, size_type, edge_descriptor
542 typedef typename mpl::if_<
543 typename Directed::is_directed_t, DirInEdgeIter, UnDirInEdgeIter
544 >::type unfiltered_in_edge_iter;
546 typedef detail::adj_matrix_edge_iter<
547 Directed, MatrixIter, size_type, edge_descriptor
548 > unfiltered_edge_iter;
552 // IncidenceGraph concept required types
553 typedef filter_iterator<detail::does_edge_exist, unfiltered_out_edge_iter>
556 typedef size_type degree_size_type;
558 // BidirectionalGraph required types
559 typedef filter_iterator<detail::does_edge_exist, unfiltered_in_edge_iter>
562 // AdjacencyGraph required types
563 typedef typename adjacency_iterator_generator<self,
564 vertex_descriptor, out_edge_iterator>::type adjacency_iterator;
566 // VertexListGraph required types
567 typedef size_type vertices_size_type;
568 typedef integer_range<vertex_descriptor> VertexList;
569 typedef typename VertexList::iterator vertex_iterator;
571 // EdgeListGraph required types
572 typedef size_type edges_size_type;
573 typedef filter_iterator<
574 detail::does_edge_exist, unfiltered_edge_iter
577 // PropertyGraph required types
578 typedef adjacency_matrix_class_tag graph_tag;
580 // Constructor required by MutableGraph
581 adjacency_matrix(vertices_size_type n_vertices,
582 const GraphProperty& p = GraphProperty())
583 : m_matrix(Directed::is_directed ?
584 (n_vertices * n_vertices)
585 : (n_vertices * (n_vertices + 1) / 2)),
586 m_vertex_set(0, n_vertices),
587 m_vertex_properties(n_vertices),
591 template <typename EdgeIterator>
592 adjacency_matrix(EdgeIterator first,
594 vertices_size_type n_vertices,
595 const GraphProperty& p = GraphProperty())
596 : m_matrix(Directed::is_directed ?
597 (n_vertices * n_vertices)
598 : (n_vertices * (n_vertices + 1) / 2)),
599 m_vertex_set(0, n_vertices),
600 m_vertex_properties(n_vertices),
604 for (; first != last; ++first) {
605 add_edge(first->first, first->second, *this);
609 template <typename EdgeIterator, typename EdgePropertyIterator>
610 adjacency_matrix(EdgeIterator first,
612 EdgePropertyIterator ep_iter,
613 vertices_size_type n_vertices,
614 const GraphProperty& p = GraphProperty())
615 : m_matrix(Directed::is_directed ?
616 (n_vertices * n_vertices)
617 : (n_vertices * (n_vertices + 1) / 2)),
618 m_vertex_set(0, n_vertices),
619 m_vertex_properties(n_vertices),
623 for (; first != last; ++first, ++ep_iter) {
624 add_edge(first->first, first->second, *ep_iter, *this);
628 #ifndef BOOST_GRAPH_NO_BUNDLED_PROPERTIES
629 // Directly access a vertex or edge bundle
630 vertex_bundled& operator[](vertex_descriptor v)
631 { return get(vertex_bundle, *this, v); }
633 const vertex_bundled& operator[](vertex_descriptor v) const
634 { return get(vertex_bundle, *this, v); }
636 edge_bundled& operator[](edge_descriptor e)
637 { return get(edge_bundle, *this, e); }
639 const edge_bundled& operator[](edge_descriptor e) const
640 { return get(edge_bundle, *this, e); }
642 graph_bundled& operator[](graph_bundle_t)
643 { return get_property(*this); }
645 const graph_bundled& operator[](graph_bundle_t) const
646 { return get_property(*this); }
649 //private: if friends worked, these would be private
651 typename Matrix::const_reference
652 get_edge(vertex_descriptor u, vertex_descriptor v) const {
653 if (Directed::is_directed)
654 return m_matrix[u * m_vertex_set.size() + v];
658 return m_matrix[u * (u + 1)/2 + v];
661 typename Matrix::reference
662 get_edge(vertex_descriptor u, vertex_descriptor v) {
663 if (Directed::is_directed)
664 return m_matrix[u * m_vertex_set.size() + v];
668 return m_matrix[u * (u + 1)/2 + v];
673 VertexList m_vertex_set;
674 std::vector<vertex_property_type> m_vertex_properties;
675 size_type m_num_edges;
676 graph_property_type m_property;
679 //=========================================================================
680 // Functions required by the AdjacencyMatrix concept
682 template <typename D, typename VP, typename EP, typename GP, typename A>
683 std::pair<typename adjacency_matrix<D,VP,EP,GP,A>::edge_descriptor,
685 edge(typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor u,
686 typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor v,
687 const adjacency_matrix<D,VP,EP,GP,A>& g)
689 bool exists = detail::get_edge_exists(g.get_edge(u,v), 0);
690 typename adjacency_matrix<D,VP,EP,GP,A>::edge_descriptor
691 e(exists, u, v, &detail::get_edge_property(g.get_edge(u,v)));
692 return std::make_pair(e, exists);
695 //=========================================================================
696 // Functions required by the IncidenceGraph concept
699 template <typename VP, typename EP, typename GP, typename A>
700 std::pair<typename adjacency_matrix<directedS,VP,EP,GP,A>::out_edge_iterator,
701 typename adjacency_matrix<directedS,VP,EP,GP,A>::out_edge_iterator>
703 (typename adjacency_matrix<directedS,VP,EP,GP,A>::vertex_descriptor u,
704 const adjacency_matrix<directedS,VP,EP,GP,A>& g_)
706 typedef adjacency_matrix<directedS,VP,EP,GP,A> Graph;
707 Graph& g = const_cast<Graph&>(g_);
708 typename Graph::vertices_size_type offset = u * g.m_vertex_set.size();
709 typename Graph::MatrixIter f = g.m_matrix.begin() + offset;
710 typename Graph::MatrixIter l = f + g.m_vertex_set.size();
711 typename Graph::unfiltered_out_edge_iter
712 first(f, u, g.m_vertex_set.size())
713 , last(l, u, g.m_vertex_set.size());
714 detail::does_edge_exist pred;
715 typedef typename Graph::out_edge_iterator out_edge_iterator;
716 return std::make_pair(out_edge_iterator(pred, first, last),
717 out_edge_iterator(pred, last, last));
721 template <typename VP, typename EP, typename GP, typename A>
723 typename adjacency_matrix<undirectedS,VP,EP,GP,A>::out_edge_iterator,
724 typename adjacency_matrix<undirectedS,VP,EP,GP,A>::out_edge_iterator>
726 (typename adjacency_matrix<undirectedS,VP,EP,GP,A>::vertex_descriptor u,
727 const adjacency_matrix<undirectedS,VP,EP,GP,A>& g_)
729 typedef adjacency_matrix<undirectedS,VP,EP,GP,A> Graph;
730 Graph& g = const_cast<Graph&>(g_);
731 typename Graph::vertices_size_type offset = u * (u + 1) / 2;
732 typename Graph::MatrixIter f = g.m_matrix.begin() + offset;
733 typename Graph::MatrixIter l = g.m_matrix.end();
735 typename Graph::unfiltered_out_edge_iter
736 first(f, u, g.m_vertex_set.size())
737 , last(l, u, g.m_vertex_set.size());
739 detail::does_edge_exist pred;
740 typedef typename Graph::out_edge_iterator out_edge_iterator;
741 return std::make_pair(out_edge_iterator(pred, first, last),
742 out_edge_iterator(pred, last, last));
746 template <typename D, typename VP, typename EP, typename GP, typename A>
747 typename adjacency_matrix<D,VP,EP,GP,A>::degree_size_type
748 out_degree(typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor u,
749 const adjacency_matrix<D,VP,EP,GP,A>& g)
751 typename adjacency_matrix<D,VP,EP,GP,A>::degree_size_type n = 0;
752 typename adjacency_matrix<D,VP,EP,GP,A>::out_edge_iterator f, l;
753 for (boost::tie(f, l) = out_edges(u, g); f != l; ++f)
759 template <typename D, typename VP, typename EP, typename GP, typename A,
760 typename Dir, typename Vertex>
761 typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor
762 source(const detail::matrix_edge_desc_impl<Dir,Vertex>& e,
763 const adjacency_matrix<D,VP,EP,GP,A>&)
769 template <typename D, typename VP, typename EP, typename GP, typename A,
770 typename Dir, typename Vertex>
771 typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor
772 target(const detail::matrix_edge_desc_impl<Dir,Vertex>& e,
773 const adjacency_matrix<D,VP,EP,GP,A>&)
778 //=========================================================================
779 // Functions required by the BidirectionalGraph concept
782 template <typename VP, typename EP, typename GP, typename A>
783 std::pair<typename adjacency_matrix<directedS,VP,EP,GP,A>::in_edge_iterator,
784 typename adjacency_matrix<directedS,VP,EP,GP,A>::in_edge_iterator>
786 (typename adjacency_matrix<directedS,VP,EP,GP,A>::vertex_descriptor u,
787 const adjacency_matrix<directedS,VP,EP,GP,A>& g_)
789 typedef adjacency_matrix<directedS,VP,EP,GP,A> Graph;
790 Graph& g = const_cast<Graph&>(g_);
791 typename Graph::MatrixIter f = g.m_matrix.begin() + u;
792 typename Graph::MatrixIter l = g.m_matrix.end();
793 typename Graph::unfiltered_in_edge_iter
794 first(f, l, u, g.m_vertex_set.size())
795 , last(l, l, u, g.m_vertex_set.size());
796 detail::does_edge_exist pred;
797 typedef typename Graph::in_edge_iterator in_edge_iterator;
798 return std::make_pair(in_edge_iterator(pred, first, last),
799 in_edge_iterator(pred, last, last));
803 template <typename VP, typename EP, typename GP, typename A>
805 typename adjacency_matrix<undirectedS,VP,EP,GP,A>::in_edge_iterator,
806 typename adjacency_matrix<undirectedS,VP,EP,GP,A>::in_edge_iterator>
808 (typename adjacency_matrix<undirectedS,VP,EP,GP,A>::vertex_descriptor u,
809 const adjacency_matrix<undirectedS,VP,EP,GP,A>& g_)
811 typedef adjacency_matrix<undirectedS,VP,EP,GP,A> Graph;
812 Graph& g = const_cast<Graph&>(g_);
813 typename Graph::vertices_size_type offset = u * (u + 1) / 2;
814 typename Graph::MatrixIter f = g.m_matrix.begin() + offset;
815 typename Graph::MatrixIter l = g.m_matrix.end();
817 typename Graph::unfiltered_in_edge_iter
818 first(f, u, g.m_vertex_set.size())
819 , last(l, u, g.m_vertex_set.size());
821 detail::does_edge_exist pred;
822 typedef typename Graph::in_edge_iterator in_edge_iterator;
823 return std::make_pair(in_edge_iterator(pred, first, last),
824 in_edge_iterator(pred, last, last));
828 template <typename D, typename VP, typename EP, typename GP, typename A>
829 typename adjacency_matrix<D,VP,EP,GP,A>::degree_size_type
830 in_degree(typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor u,
831 const adjacency_matrix<D,VP,EP,GP,A>& g)
833 typename adjacency_matrix<D,VP,EP,GP,A>::degree_size_type n = 0;
834 typename adjacency_matrix<D,VP,EP,GP,A>::in_edge_iterator f, l;
835 for (boost::tie(f, l) = in_edges(u, g); f != l; ++f)
840 //=========================================================================
841 // Functions required by the AdjacencyGraph concept
843 template <typename D, typename VP, typename EP, typename GP, typename A>
844 std::pair<typename adjacency_matrix<D,VP,EP,GP,A>::adjacency_iterator,
845 typename adjacency_matrix<D,VP,EP,GP,A>::adjacency_iterator>
847 (typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor u,
848 const adjacency_matrix<D,VP,EP,GP,A>& g_)
850 typedef adjacency_matrix<D,VP,EP,GP,A> Graph;
851 const Graph& cg = static_cast<const Graph&>(g_);
852 Graph& g = const_cast<Graph&>(cg);
853 typedef typename Graph::adjacency_iterator adjacency_iterator;
854 typename Graph::out_edge_iterator first, last;
855 boost::tie(first, last) = out_edges(u, g);
856 return std::make_pair(adjacency_iterator(first, &g),
857 adjacency_iterator(last, &g));
860 //=========================================================================
861 // Functions required by the VertexListGraph concept
863 template <typename D, typename VP, typename EP, typename GP, typename A>
864 std::pair<typename adjacency_matrix<D,VP,EP,GP,A>::vertex_iterator,
865 typename adjacency_matrix<D,VP,EP,GP,A>::vertex_iterator>
866 vertices(const adjacency_matrix<D,VP,EP,GP,A>& g_) {
867 typedef adjacency_matrix<D,VP,EP,GP,A> Graph;
868 Graph& g = const_cast<Graph&>(g_);
869 return std::make_pair(g.m_vertex_set.begin(), g.m_vertex_set.end());
872 template <typename D, typename VP, typename EP, typename GP, typename A>
873 typename adjacency_matrix<D,VP,EP,GP,A>::vertices_size_type
874 num_vertices(const adjacency_matrix<D,VP,EP,GP,A>& g) {
875 return g.m_vertex_set.size();
878 //=========================================================================
879 // Functions required by the EdgeListGraph concept
881 template <typename D, typename VP, typename EP, typename GP, typename A>
882 std::pair<typename adjacency_matrix<D,VP,EP,GP,A>::edge_iterator,
883 typename adjacency_matrix<D,VP,EP,GP,A>::edge_iterator>
884 edges(const adjacency_matrix<D,VP,EP,GP,A>& g_)
886 typedef adjacency_matrix<D,VP,EP,GP,A> Graph;
887 Graph& g = const_cast<Graph&>(g_);
889 typename Graph::unfiltered_edge_iter
890 first(g.m_matrix.begin(), g.m_matrix.begin(),
891 g.m_vertex_set.size()),
892 last(g.m_matrix.end(), g.m_matrix.begin(),
893 g.m_vertex_set.size());
894 detail::does_edge_exist pred;
895 typedef typename Graph::edge_iterator edge_iterator;
896 return std::make_pair(edge_iterator(pred, first, last),
897 edge_iterator(pred, last, last));
901 template <typename D, typename VP, typename EP, typename GP, typename A>
902 typename adjacency_matrix<D,VP,EP,GP,A>::edges_size_type
903 num_edges(const adjacency_matrix<D,VP,EP,GP,A>& g)
905 return g.m_num_edges;
908 //=========================================================================
909 // Functions required by the MutableGraph concept
912 template <typename D, typename VP, typename EP, typename GP, typename A,
914 std::pair<typename adjacency_matrix<D,VP,EP,GP,A>::edge_descriptor, bool>
915 add_edge(typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor u,
916 typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor v,
918 adjacency_matrix<D,VP,EP,GP,A>& g)
920 typedef typename adjacency_matrix<D,VP,EP,GP,A>::edge_descriptor
922 if (detail::get_edge_exists(g.get_edge(u,v), 0) == false) {
924 detail::set_edge_property(g.get_edge(u,v), EP(ep), 0);
925 detail::set_edge_exists(g.get_edge(u,v), true, 0);
926 return std::make_pair
927 (edge_descriptor(true, u, v, &detail::get_edge_property(g.get_edge(u,v))),
930 return std::make_pair
931 (edge_descriptor(true, u, v, &detail::get_edge_property(g.get_edge(u,v))),
935 template <typename D, typename VP, typename EP, typename GP, typename A>
936 std::pair<typename adjacency_matrix<D,VP,EP,GP,A>::edge_descriptor, bool>
937 add_edge(typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor u,
938 typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor v,
939 adjacency_matrix<D,VP,EP,GP,A>& g)
942 return add_edge(u, v, ep, g);
946 template <typename D, typename VP, typename EP, typename GP, typename A>
948 remove_edge(typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor u,
949 typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor v,
950 adjacency_matrix<D,VP,EP,GP,A>& g)
952 // Don'remove the edge unless it already exists.
953 if(detail::get_edge_exists(g.get_edge(u,v), 0)) {
955 detail::set_edge_exists(g.get_edge(u,v), false, 0);
960 template <typename D, typename VP, typename EP, typename GP, typename A>
962 remove_edge(typename adjacency_matrix<D,VP,EP,GP,A>::edge_descriptor e,
963 adjacency_matrix<D,VP,EP,GP,A>& g)
965 remove_edge(source(e, g), target(e, g), g);
969 template <typename D, typename VP, typename EP, typename GP, typename A>
970 inline typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor
971 add_vertex(adjacency_matrix<D,VP,EP,GP,A>& g) {
972 // UNDER CONSTRUCTION
974 return *vertices(g).first;
977 template <typename D, typename VP, typename EP, typename GP, typename A,
979 inline typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor
980 add_vertex(const VP2& /*vp*/, adjacency_matrix<D,VP,EP,GP,A>& g) {
981 // UNDER CONSTRUCTION
983 return *vertices(g).first;
986 template <typename D, typename VP, typename EP, typename GP, typename A>
988 remove_vertex(typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor /*u*/,
989 adjacency_matrix<D,VP,EP,GP,A>& /*g*/)
991 // UNDER CONSTRUCTION
996 template <typename VP, typename EP, typename GP, typename A>
999 (typename adjacency_matrix<directedS,VP,EP,GP,A>::vertex_descriptor u,
1000 adjacency_matrix<directedS,VP,EP,GP,A>& g)
1002 typename adjacency_matrix<directedS,VP,EP,GP,A>::vertex_iterator
1004 for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
1005 remove_edge(u, *vi, g);
1006 for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
1007 remove_edge(*vi, u, g);
1011 template <typename VP, typename EP, typename GP, typename A>
1014 (typename adjacency_matrix<undirectedS,VP,EP,GP,A>::vertex_descriptor u,
1015 adjacency_matrix<undirectedS,VP,EP,GP,A>& g)
1017 typename adjacency_matrix<undirectedS,VP,EP,GP,A>::vertex_iterator
1019 for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
1020 remove_edge(u, *vi, g);
1023 //=========================================================================
1024 // Functions required by the PropertyGraph concept
1026 template <typename D, typename VP, typename EP, typename GP, typename A,
1027 typename Prop, typename Kind>
1028 struct adj_mat_pm_helper;
1030 template <typename D, typename VP, typename EP, typename GP, typename A,
1032 struct adj_mat_pm_helper<D, VP, EP, GP, A, Prop, vertex_property_tag> {
1033 typedef typename graph_traits<adjacency_matrix<D, VP, EP, GP, A> >::vertex_descriptor arg_type;
1034 typedef typed_identity_property_map<arg_type> vi_map_type;
1035 typedef iterator_property_map<typename std::vector<VP>::iterator, vi_map_type> all_map_type;
1036 typedef iterator_property_map<typename std::vector<VP>::const_iterator, vi_map_type> all_map_const_type;
1037 typedef transform_value_property_map<
1038 detail::lookup_one_property_f<VP, Prop>,
1041 typedef transform_value_property_map<
1042 detail::lookup_one_property_f<const VP, Prop>,
1045 typedef typename property_traits<type>::reference single_nonconst_type;
1046 typedef typename property_traits<const_type>::reference single_const_type;
1048 static type get_nonconst(adjacency_matrix<D, VP, EP, GP, A>& g, Prop prop) {
1049 return type(prop, all_map_type(g.m_vertex_properties.begin(), vi_map_type()));
1052 static const_type get_const(const adjacency_matrix<D, VP, EP, GP, A>& g, Prop prop) {
1053 return const_type(prop, all_map_const_type(g.m_vertex_properties.begin(), vi_map_type()));
1056 static single_nonconst_type get_nonconst_one(adjacency_matrix<D, VP, EP, GP, A>& g, Prop prop, arg_type v) {
1057 return lookup_one_property<VP, Prop>::lookup(g.m_vertex_properties[v], prop);
1060 static single_const_type get_const_one(const adjacency_matrix<D, VP, EP, GP, A>& g, Prop prop, arg_type v) {
1061 return lookup_one_property<const VP, Prop>::lookup(g.m_vertex_properties[v], prop);
1065 template <typename D, typename VP, typename EP, typename GP, typename A,
1067 struct adj_mat_pm_helper<D, VP, EP, GP, A, Tag, edge_property_tag> {
1068 typedef typename graph_traits<adjacency_matrix<D, VP, EP, GP, A> >::edge_descriptor edge_descriptor;
1070 template <typename IsConst>
1071 struct lookup_property_from_edge {
1073 lookup_property_from_edge(Tag tag): tag(tag) {}
1074 typedef typename boost::mpl::if_<IsConst, const EP, EP>::type ep_type_nonref;
1075 typedef ep_type_nonref& ep_type;
1076 typedef typename lookup_one_property<ep_type_nonref, Tag>::type& result_type;
1077 result_type operator()(edge_descriptor e) const {
1078 return lookup_one_property<ep_type_nonref, Tag>::lookup(*static_cast<ep_type_nonref*>(e.get_property()), tag);
1082 typedef function_property_map<
1083 lookup_property_from_edge<boost::mpl::false_>,
1084 typename graph_traits<adjacency_matrix<D, VP, EP, GP, A> >::edge_descriptor> type;
1085 typedef function_property_map<
1086 lookup_property_from_edge<boost::mpl::true_>,
1087 typename graph_traits<adjacency_matrix<D, VP, EP, GP, A> >::edge_descriptor> const_type;
1088 typedef edge_descriptor arg_type;
1089 typedef typename lookup_property_from_edge<boost::mpl::false_>::result_type single_nonconst_type;
1090 typedef typename lookup_property_from_edge<boost::mpl::true_>::result_type single_const_type;
1092 static type get_nonconst(adjacency_matrix<D, VP, EP, GP, A>& g, Tag tag) {
1096 static const_type get_const(const adjacency_matrix<D, VP, EP, GP, A>& g, Tag tag) {
1097 return const_type(tag);
1100 static single_nonconst_type get_nonconst_one(adjacency_matrix<D, VP, EP, GP, A>& g, Tag tag, edge_descriptor e) {
1101 return lookup_one_property<EP, Tag>::lookup(*static_cast<EP*>(e.get_property()), tag);
1104 static single_const_type get_const_one(const adjacency_matrix<D, VP, EP, GP, A>& g, Tag tag, edge_descriptor e) {
1105 return lookup_one_property<const EP, Tag>::lookup(*static_cast<const EP*>(e.get_property()), tag);
1109 template <typename D, typename VP, typename EP, typename GP, typename A,
1111 struct property_map<adjacency_matrix<D,VP,EP,GP,A>, Tag>
1112 : adj_mat_pm_helper<D, VP, EP, GP, A, Tag,
1113 typename detail::property_kind_from_graph<adjacency_matrix<D, VP, EP, GP, A>, Tag>::type> {};
1115 template <typename D, typename VP, typename EP, typename GP, typename A,
1117 typename property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::type
1118 get(Tag tag, adjacency_matrix<D, VP, EP, GP, A>& g) {
1119 return property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::get_nonconst(g, tag);
1122 template <typename D, typename VP, typename EP, typename GP, typename A,
1124 typename property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::const_type
1125 get(Tag tag, const adjacency_matrix<D, VP, EP, GP, A>& g) {
1126 return property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::get_const(g, tag);
1129 template <typename D, typename VP, typename EP, typename GP, typename A,
1131 typename property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::single_nonconst_type
1132 get(Tag tag, adjacency_matrix<D, VP, EP, GP, A>& g, typename property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::arg_type a) {
1133 return property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::get_nonconst_one(g, tag, a);
1136 template <typename D, typename VP, typename EP, typename GP, typename A,
1138 typename property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::single_const_type
1139 get(Tag tag, const adjacency_matrix<D, VP, EP, GP, A>& g, typename property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::arg_type a) {
1140 return property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::get_const_one(g, tag, a);
1143 template <typename D, typename VP, typename EP, typename GP, typename A,
1147 adjacency_matrix<D, VP, EP, GP, A>& g,
1148 typename property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::arg_type a,
1149 typename property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::single_const_type val) {
1150 property_map<adjacency_matrix<D, VP, EP, GP, A>, Tag>::get_nonconst_one(g, tag, a) = val;
1154 template <typename D, typename VP, typename EP, typename GP, typename A,
1155 typename Tag, typename Value>
1157 set_property(adjacency_matrix<D,VP,EP,GP,A>& g, Tag tag, const Value& value)
1159 get_property_value(g.m_property, tag) = value;
1162 template <typename D, typename VP, typename EP, typename GP, typename A,
1164 inline typename graph_property<adjacency_matrix<D,VP,EP,GP,A>, Tag>::type&
1165 get_property(adjacency_matrix<D,VP,EP,GP,A>& g, Tag tag)
1167 return get_property_value(g.m_property, tag);
1170 template <typename D, typename VP, typename EP, typename GP, typename A,
1172 inline const typename graph_property<adjacency_matrix<D,VP,EP,GP,A>, Tag>::type&
1173 get_property(const adjacency_matrix<D,VP,EP,GP,A>& g, Tag tag)
1175 return get_property_value(g.m_property, tag);
1178 //=========================================================================
1179 // Vertex Property Map
1181 template <typename D, typename VP, typename EP, typename GP, typename A>
1182 struct property_map<adjacency_matrix<D, VP, EP, GP, A>, vertex_index_t> {
1183 typedef typename adjacency_matrix<D, VP, EP, GP, A>::vertex_descriptor Vertex;
1184 typedef typed_identity_property_map<Vertex> type;
1185 typedef type const_type;
1188 template <typename D, typename VP, typename EP, typename GP, typename A>
1189 typename property_map<adjacency_matrix<D, VP, EP, GP, A>, vertex_index_t>::const_type
1190 get(vertex_index_t, adjacency_matrix<D, VP, EP, GP, A>&) {
1191 return typename property_map<adjacency_matrix<D, VP, EP, GP, A>, vertex_index_t>::const_type();
1194 template <typename D, typename VP, typename EP, typename GP, typename A>
1195 typename adjacency_matrix<D, VP, EP, GP, A>::vertex_descriptor
1197 adjacency_matrix<D, VP, EP, GP, A>&,
1198 typename adjacency_matrix<D, VP, EP, GP, A>::vertex_descriptor v) {
1202 template <typename D, typename VP, typename EP, typename GP, typename A>
1203 typename property_map<adjacency_matrix<D, VP, EP, GP, A>, vertex_index_t>::const_type
1204 get(vertex_index_t, const adjacency_matrix<D, VP, EP, GP, A>&) {
1205 return typename property_map<adjacency_matrix<D, VP, EP, GP, A>, vertex_index_t>::const_type();
1208 template <typename D, typename VP, typename EP, typename GP, typename A>
1209 typename adjacency_matrix<D, VP, EP, GP, A>::vertex_descriptor
1211 const adjacency_matrix<D, VP, EP, GP, A>&,
1212 typename adjacency_matrix<D, VP, EP, GP, A>::vertex_descriptor v) {
1216 //=========================================================================
1219 template <typename D, typename VP, typename EP, typename GP, typename A>
1220 typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor
1221 vertex(typename adjacency_matrix<D,VP,EP,GP,A>::vertices_size_type n,
1222 const adjacency_matrix<D,VP,EP,GP,A>&)
1227 template <typename D, typename VP, typename EP, typename GP, typename A>
1228 struct graph_mutability_traits<adjacency_matrix<D, VP, EP, GP, A> > {
1229 typedef mutable_edge_property_graph_tag category;
1233 } // namespace boost
1235 #endif // BOOST_ADJACENCY_MATRIX_HPP