Home | Documentation | Download | Platforms | Projects | Mailing Lists | Version History
00001 //========================================================================== 00002 // 00003 // edge_data.h - Internal header: DO NO USE IT DIRECTLY !!! 00004 // 00005 //========================================================================== 00006 // $Id: edge_data.h,v 1.9 2000/02/03 12:49:50 raitner Exp $ 00007 00008 #ifndef GTL_EDGE_DATA_H 00009 #define GTL_EDGE_DATA_H 00010 00011 #include <GTL/GTL.h> 00012 #include <GTL/node.h> 00013 #include <GTL/edge.h> 00014 00015 #include <list> 00016 00017 __GTL_BEGIN_NAMESPACE 00018 00022 class GTL_EXTERN edge_data 00023 { 00024 public: 00025 int id; // internal numbering 00026 list<node> nodes[2]; // nodes[0] = sources, 00027 // nodes[1] = targets 00028 list<list<edge>::iterator> adj_pos[2];// positions in the adjacency lists 00029 // of sources and targets 00030 list<edge>::iterator pos; // position in the list of all edges 00031 bool hidden; 00032 graph* owner; 00033 }; 00034 00035 __GTL_END_NAMESPACE 00036 00037 #endif // GTL_EDGE_DATA_H 00038 00039 //-------------------------------------------------------------------------- 00040 // end of file 00041 //--------------------------------------------------------------------------
University of Passau - FMI - Theoretical Computer Science