1 #ifndef __CPEXTENSIONS__DATASTRUCTURES__GRAPH__HXX__
2 #define __CPEXTENSIONS__DATASTRUCTURES__GRAPH__HXX__
4 // -------------------------------------------------------------------------
5 template< class V, class C, class I >
6 typename cpExtensions::DataStructures::Graph< V, C, I >::
7 TVertices::iterator cpExtensions::DataStructures::Graph< V, C, I >::
10 return( this->m_Vertices.begin( ) );
13 // -------------------------------------------------------------------------
14 template< class V, class C, class I >
15 typename cpExtensions::DataStructures::Graph< V, C, I >::
16 TVertices::iterator cpExtensions::DataStructures::Graph< V, C, I >::
19 return( this->m_Vertices.end( ) );
22 // -------------------------------------------------------------------------
23 template< class V, class C, class I >
24 typename cpExtensions::DataStructures::Graph< V, C, I >::
25 TVertices::const_iterator cpExtensions::DataStructures::Graph< V, C, I >::
26 BeginVertices( ) const
28 return( this->m_Vertices.begin( ) );
31 // -------------------------------------------------------------------------
32 template< class V, class C, class I >
33 typename cpExtensions::DataStructures::Graph< V, C, I >::
34 TVertices::const_iterator cpExtensions::DataStructures::Graph< V, C, I >::
37 return( this->m_Vertices.end( ) );
40 // -------------------------------------------------------------------------
41 template< class V, class C, class I >
42 typename cpExtensions::DataStructures::Graph< V, C, I >::
43 TMatrix::iterator cpExtensions::DataStructures::Graph< V, C, I >::
46 return( this->m_Matrix.begin( ) );
49 // -------------------------------------------------------------------------
50 template< class V, class C, class I >
51 typename cpExtensions::DataStructures::Graph< V, C, I >::
52 TMatrix::iterator cpExtensions::DataStructures::Graph< V, C, I >::
55 return( this->m_Matrix.end( ) );
58 // -------------------------------------------------------------------------
59 template< class V, class C, class I >
60 typename cpExtensions::DataStructures::Graph< V, C, I >::
61 TMatrix::const_iterator cpExtensions::DataStructures::Graph< V, C, I >::
62 BeginEdgesRows( ) const
64 return( this->m_Matrix.begin( ) );
67 // -------------------------------------------------------------------------
68 template< class V, class C, class I >
69 typename cpExtensions::DataStructures::Graph< V, C, I >::
70 TMatrix::const_iterator cpExtensions::DataStructures::Graph< V, C, I >::
73 return( this->m_Matrix.end( ) );
76 // -------------------------------------------------------------------------
77 template< class V, class C, class I >
78 bool cpExtensions::DataStructures::Graph< V, C, I >::
79 HasVertexIndex( const I& index ) const
81 return( this->m_Vertices.find( index ) != this->m_Vertices.end( ) );
84 // -------------------------------------------------------------------------
85 template< class V, class C, class I >
86 void cpExtensions::DataStructures::Graph< V, C, I >::
87 InsertVertex( const I& index, V& vertex )
89 this->m_Vertices[ index ] = vertex;
92 // -------------------------------------------------------------------------
93 template< class V, class C, class I >
94 V& cpExtensions::DataStructures::Graph< V, C, I >::
95 GetVertex( const I& index )
97 return( this->m_Vertices[ index ] );
100 // -------------------------------------------------------------------------
101 template< class V, class C, class I >
102 const V& cpExtensions::DataStructures::Graph< V, C, I >::
103 GetVertex( const I& index ) const
105 return( this->m_Vertices[ index ] );
108 // -------------------------------------------------------------------------
109 template< class V, class C, class I >
110 void cpExtensions::DataStructures::Graph< V, C, I >::
111 AddConnection( const I& orig, const I& dest, const C& cost )
113 this->m_Matrix[ orig ][ dest ].push_back( cost );
116 // -------------------------------------------------------------------------
117 template< class V, class C, class I >
118 std::set< I > cpExtensions::DataStructures::Graph< V, C, I >::
123 auto vIt = this->m_Vertices.begin( );
124 for( ; vIt != this->m_Vertices.end( ); ++vIt )
125 sinks.insert( vIt->first );
126 auto mIt = this->m_Matrix.begin( );
127 for( ; mIt != this->m_Matrix.end( ); ++mIt )
128 sinks.erase( mIt->first );
133 // -------------------------------------------------------------------------
134 template< class V, class C, class I >
135 cpExtensions::DataStructures::Graph< V, C, I >::
141 // -------------------------------------------------------------------------
142 template< class V, class C, class I >
143 cpExtensions::DataStructures::Graph< V, C, I >::
148 #endif // __CPEXTENSIONS__DATASTRUCTURES__GRAPH__HXX__