30 #ifndef __CLAW_GRAPH_HPP__
31 #define __CLAW_GRAPH_HPP__
59 virtual const char*
what()
const throw();
63 const std::string m_msg;
78 template <
class S,
class A = meta::no_type,
class Comp = std::less<S> >
97 typedef std::map<vertex_type, neighbours_list, vertex_compare>
108 friend class graph<vertex_type, edge_type, vertex_compare>;
111 typedef const vertex_type value_type;
112 typedef const vertex_type& reference;
113 typedef const vertex_type*
const pointer;
114 typedef ptrdiff_t difference_type;
116 typedef std::bidirectional_iterator_tag iterator_category;
136 typename graph_content::const_iterator m_iterator;
146 friend class graph<vertex_type, edge_type, vertex_compare>;
159 const edge_type&
label()
const;
160 const vertex_type&
source()
const;
161 const vertex_type&
target()
const;
164 void set(
const edge_type& l,
const vertex_type& s,
165 const vertex_type& t );
168 edge_type
const* m_label;
169 vertex_type
const* m_source;
170 vertex_type
const* m_target;
176 typedef const edge*
const pointer;
177 typedef ptrdiff_t difference_type;
179 typedef std::bidirectional_iterator_tag iterator_category;
196 typename graph_content::const_iterator it_end,
197 typename graph_content::const_iterator it_s,
198 typename neighbours_list::const_iterator it_d );
202 typename graph_content::const_iterator m_vertex_begin;
205 typename graph_content::const_iterator m_vertex_end;
208 typename graph_content::const_iterator m_vertex_iterator;
211 typename neighbours_list::const_iterator m_neighbours_iterator;
222 typedef std::reverse_iterator<vertex_iterator> reverse_vertex_iterator;
223 typedef std::reverse_iterator<edge_iterator> reverse_edge_iterator;
234 void vertices( std::vector<vertex_type>& v )
const;
266 std::map<vertex_type, std::size_t, vertex_compare> m_inner_degrees;
269 std::size_t m_edges_count;
277 #endif // __CLAW_GRAPH_HPP__