Hi,

I am using boost 1.33.1 with Visual C++ 2002 (v
7.0.9466) and Windows XP (no service pack).

I was doing some experiments with boost Graph library
.
When running the program i get the following error on
add_edge():

----------------------------------------------------------------------

An unhandled exception of type
'System.TypeLoadException' occurred in test.exe

Additional information: Could not load type
std._Ptrit<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>,boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>::config::stored_vertex,int,boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>,boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>::config::stored_vertex
*,boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>,boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>::config::stored_vertex
&,boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,bo0a748880
from assembly test, Version=0.0.0.0, Culture=neutral,
PublicKeyToken=null.
----------------------------------------------------------------------


The program is:
----------------------------------------------------------------------
#include <iostream> // for std::cout
#include <utility> // for std::pair
#include <algorithm> // for
std::for_each
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>

using namespace boost;

int main(int,char*[])
{
// create a typedef for the Graph type
typedef adjacency_list<vecS, vecS, bidirectionalS>
Graph;


// Make convenient labels for the vertices
enum { A, B, C, D, E, N };
const int num_vertices = N;
const char* name = "ABCDE";

// writing out the edges in the graph
typedef std::pair<int, int> Edge;
Edge edge_array[] =
{ Edge(A,B), Edge(A,D), Edge(C,A), Edge(D,C),
Edge(C,E), Edge(B,D), Edge(D,E) };

const int num_edges =
sizeof(edge_array)/sizeof(edge_array[0]);

// declare a graph object
Graph g(num_vertices);


// add the edges to the graph object
for (int i = 0; i < num_edges; ++i)
{
add_edge(edge_array[i].first, edge_array[i].second,
g);
}

//// get the property map for vertex indices
typedef property_map<Graph, vertex_index_t>::type
IndexMap;
IndexMap index = get(vertex_index, g);

std::cout << "vertices(g) = ";
typedef graph_traits<Graph>::vertex_iterator
vertex_iter;
std::pair<vertex_iter, vertex_iter> vp;
for (vp = vertices(g); vp.first != vp.second;
++vp.first)
std::cout << index[*vp.first] << " ";
std::cout << std::endl;

float finish;
std::cin >> finish;

return 0;
}

----------------------------------------------------------------------

Thanks,
Joćo Orvalho