x
Yes
No
Do you want to visit DriveHQ English website?
Inicio
Características
Precios
Prueba gratuita
Software cliente
Acerca de nosotros
Servidor de archivos
|
Solución de copias de seguridad
|
Servidor FTP
|
Servidor de correo electrónico
|
Alojamiento web
|
Software cliente
Servidor de archivos
Solución de copia de seguridad
Servidor FTP
Servidor de correo electrónico
Alojamiento web
Software cliente
adjacency_iterator.hpp - Hosted on DriveHQ Cloud IT Platform
Arriba
Subir
Descargar
Compartir
Publicar
Nueva carpeta
Nuevo archivo
Copiar
Cortar
Eliminar
Pegar
Clasificación
Actualizar
Ruta de la carpeta: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\graph\adjacency_iterator.hpp
Girar
Efecto
Propiedad
Historial
//======================================================================= // Copyright 2002 Indiana University. // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) //======================================================================= #ifndef BOOST_ADJACENCY_ITERATOR_HPP #define BOOST_ADJACENCY_ITERATOR_HPP #include
#include
namespace boost { template
struct adjacency_iterator : iterator_adaptor< adjacency_iterator
, OutEdgeIter , Vertex , use_default , Vertex , Difference > { typedef iterator_adaptor< adjacency_iterator
, OutEdgeIter , Vertex , use_default , Vertex , Difference > super_t; inline adjacency_iterator() {} inline adjacency_iterator(OutEdgeIter const& i, const Graph* g) : super_t(i), m_g(g) { } inline Vertex dereference() const { return target(*this->base(), *m_g); } const Graph* m_g; }; template
::vertex_descriptor, class OutEdgeIter=typename graph_traits
::out_edge_iterator> class adjacency_iterator_generator { typedef typename boost::detail::iterator_traits
::difference_type difference_type; public: typedef adjacency_iterator
type; }; template
struct inv_adjacency_iterator : iterator_adaptor< inv_adjacency_iterator
, InEdgeIter , Vertex , use_default , Vertex , Difference > { typedef iterator_adaptor< inv_adjacency_iterator
, InEdgeIter , Vertex , use_default , Vertex , Difference > super_t; inline inv_adjacency_iterator() { } inline inv_adjacency_iterator(InEdgeIter const& i, const Graph* g) : super_t(i), m_g(g) { } inline Vertex dereference() const { return source(*this->base(), *m_g); } const Graph* m_g; }; template
::vertex_descriptor, class InEdgeIter = typename graph_traits
::in_edge_iterator> class inv_adjacency_iterator_generator { typedef typename boost::detail::iterator_traits
::difference_type difference_type; public: typedef inv_adjacency_iterator
type; }; } // namespace boost #endif // BOOST_DETAIL_ADJACENCY_ITERATOR_HPP
adjacency_iterator.hpp
Dirección de la página
Dirección del archivo
Anterior
2/95
Siguiente
Descargar
( 3 KB )
Comments
Total ratings:
0
Average rating:
No clasificado
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.