00001 00007 /* 00008 # Copyright (c) <2009> <Sebastien Heymann> 00009 # 00010 # Permission is hereby granted, free of charge, to any person obtaining a copy 00011 # of this software and associated documentation files (the "Software"), to deal 00012 # in the Software without restriction, including without limitation the rights 00013 # to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 00014 # copies of the Software, and to permit persons to whom the Software is 00015 # furnished to do so, subject to the following conditions: 00016 # 00017 # The above copyright notice and this permission notice shall be included in 00018 # all copies or substantial portions of the Software. 00019 # 00020 # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 00021 # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 00022 # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 00023 # AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 00024 # LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 00025 # OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 00026 # THE SOFTWARE. 00027 */ 00028 00029 #ifndef _EDGEITER_H 00030 #define _EDGEITER_H 00031 00032 #include "typedefs.h" 00033 #include "graph.h" 00034 #include "abstractiter.h" 00035 00036 #include <map> 00037 00038 namespace libgexf { 00039 00040 class Graph; 00041 00045 class EdgeIter: public AbstractIter { 00046 public: 00052 explicit EdgeIter(const libgexf::Graph* g); 00053 virtual ~EdgeIter(); 00054 00055 EdgeIter* begin(); 00056 bool hasNext() const; 00057 00065 libgexf::t_id next(); 00066 00072 libgexf::t_id currentSource() const; 00073 00079 libgexf::t_id currentTarget() const; 00080 00088 float currentProperty(libgexf::t_edge_property prop) const; 00089 private: 00090 const Graph* _graph; 00091 std::map<t_id,std::map<t_id,t_id> >::const_iterator _it; 00092 std::map<t_id,t_id>::const_iterator _it2; 00093 unsigned int _cpt; 00094 unsigned int _nb_items; 00095 t_id _current_edge_id; 00096 t_id _current_source; 00097 t_id _current_target; 00098 // TODO: optimizing for removing _current_source and _current_target copy 00099 }; 00100 00101 } 00102 00103 #endif /* _EDGEITER_H */ 00104