steven/TinySTL
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

完成adjacent_nodes

Browse Source
This commit is contained in:
邹晓航
2015-02-09 14:18:58 +08:00
parent abc076fadf
commit a99ae6007f
2 changed files with 20 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
TinySTL/Detail/Graph.impl.h
View File

@@ -42,12 +42,27 @@ namespace TinySTL{
if (equal_func(pair.first.first, index)) if (equal_func(pair.first.first, index))
return bucket_iterator(this, (pair.second).end()); return bucket_iterator(this, (pair.second).end());
} }
throw std::exception("return end error"); //throw std::exception("return end error");
return bucket_iterator();
} }
template<class Index, class Value, class EqualFunc> template<class Index, class Value, class EqualFunc>
size_t graph<Index, Value, EqualFunc>::size()const{ size_t graph<Index, Value, EqualFunc>::size()const{
return size_; return size_;
} }
template<class Index, class Value, class EqualFunc>
typename graph<Index, Value, EqualFunc>::node_sets
graph<Index, Value, EqualFunc>::adjacent_nodes(const Index& index){
node_sets s;
for (auto it = begin(index); it != end(index); ++it){
s.push_back(*it);
}
return s;
}
template<class Index, class Value, class EqualFunc>
typename graph<Index, Value, EqualFunc>::node_sets
graph<Index, Value, EqualFunc>::adjacent_nodes(const node& n){
return adjacent_nodes(n.first);
}
//******************************************************************************** //********************************************************************************
template<class Index, class Value, class EqualFunc> template<class Index, class Value, class EqualFunc>
graph_iterator<Index, Value, EqualFunc>& graph_iterator<Index, Value, EqualFunc>::operator ++(){ graph_iterator<Index, Value, EqualFunc>& graph_iterator<Index, Value, EqualFunc>::operator ++(){

7
TinySTL/Graph.h
View File

@@ -30,14 +30,15 @@ namespace TinySTL{
virtual ~graph(){}; virtual ~graph(){};
virtual void add_node(const node& item, const node_sets& nodes) = 0; virtual void add_node(const node& item, const node_sets& nodes) = 0;
//virtual void delte_node(const node& item) = 0; //virtual void delte_node(const node& item) = 0;
//virtual node_sets adjacent_nodes(const node& n) = 0;
//virtual node_sets adjacent_nodes(const Index& index) = 0;
//virtual void DFS(visiter_func_type func) = 0; //virtual void DFS(visiter_func_type func) = 0;
//virtual void BFS(visiter_func_type func) = 0; //virtual void BFS(visiter_func_type func) = 0;
static node& new_node(const Index& index, const Value& val); static node& new_node(const Index& index, const Value& val);
bool is_contained(const Index& index); bool is_contained(const Index& index);
inline static node_sets empty_node_set(); inline static node_sets empty_node_set();
node_sets adjacent_nodes(const Index& index);
node_sets adjacent_nodes(const node& n);
inline bool empty()const; inline bool empty()const;
inline size_t size()const; inline size_t size()const;
inline bucket_iterator begin(const Index& index); inline bucket_iterator begin(const Index& index);
@@ -56,7 +57,7 @@ namespace TinySTL{
typedef graph<Index, Value, EqualFunc> graph_type; typedef graph<Index, Value, EqualFunc> graph_type;
typedef typename list<typename graph_type::node>::iterator inner_it_type; typedef typename list<typename graph_type::node>::iterator inner_it_type;
public: public:
graph_iterator(cntrPtr c, inner_it_type iit) explicit graph_iterator(cntrPtr c = nullptr, inner_it_type iit = inner_it_type())
:container_(c), inner_it_(iit){} :container_(c), inner_it_(iit){}
graph_iterator& operator ++(); graph_iterator& operator ++();
const graph_iterator operator ++(int); const graph_iterator operator ++(int);