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
bandwidth.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\bandwidth.hpp
Girar
Efecto
Propiedad
Historial
// Copyright (c) Jeremy Siek 2001, Marc Wintermantel 2002 // // 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_GRAPH_BANDWIDTH_HPP #define BOOST_GRAPH_BANDWIDTH_HPP #include
// for std::min and std::max #include
#include
#include
namespace boost { template
typename graph_traits
::vertices_size_type ith_bandwidth(typename graph_traits
::vertex_descriptor i, const Graph& g, VertexIndexMap index) { BOOST_USING_STD_MAX(); typedef typename graph_traits
::vertices_size_type size_type; size_type b = 0; typename graph_traits
::out_edge_iterator e, end; for (tie(e, end) = out_edges(i, g); e != end; ++e) { int f_i = get(index, i); int f_j = get(index, target(*e, g)); using namespace std; // to call abs() unqualified if(f_i > f_j) b = max BOOST_PREVENT_MACRO_SUBSTITUTION (b, size_type(f_i - f_j)); } return b; } template
typename graph_traits
::vertices_size_type ith_bandwidth(typename graph_traits
::vertex_descriptor i, const Graph& g) { return ith_bandwidth(i, g, get(vertex_index, g)); } template
typename graph_traits
::vertices_size_type bandwidth(const Graph& g, VertexIndexMap index) { BOOST_USING_STD_MAX(); typename graph_traits
::vertices_size_type b = 0; typename graph_traits
::vertex_iterator i, end; for (tie(i, end) = vertices(g); i != end; ++i) b = max BOOST_PREVENT_MACRO_SUBSTITUTION (b, ith_bandwidth(*i, g, index)); return b; } template
typename graph_traits
::vertices_size_type bandwidth(const Graph& g) { return bandwidth(g, get(vertex_index, g)); } template
typename graph_traits
::vertices_size_type edgesum(const Graph& g, VertexIndexMap index_map) { typedef typename graph_traits
::vertices_size_type size_type; typedef typename detail::numeric_traits
::difference_type diff_t; size_type sum = 0; typename graph_traits
::edge_iterator i, end; for (tie(i, end) = edges(g); i != end; ++i) { diff_t f_u = get(index_map, source(*i, g)); diff_t f_v = get(index_map, target(*i, g)); using namespace std; // to call abs() unqualified sum += abs(f_u - f_v); } return sum; } } // namespace boost #endif // BOOST_GRAPH_BANDWIDTH_HPP
bandwidth.hpp
Dirección de la página
Dirección del archivo
Anterior
7/95
Siguiente
Descargar
( 2 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.