#define VMASK (YMASK|XMASK)
#define ESHIFT (YBITS+XBITS)
-class Graph { }; // this is a dummy as our graph has no actual representation
-
using namespace boost;
/*
}
static int voe_min(int _v) { return (_v & YMASK) ? 2 : 3; }
- static int voe_max(int _v) { return (~_v & YMASK) ? V6 : 4; }
- static int voe_degree(int _v) { return (_v & YMASK | ~_v & YMASK) ? 4 : V6; }
+ static int voe_max(int _v) { return (_v & YMASK)==(Y-1) ? V6 : 4; }
+ static int voe_degree(int _v) { return RIM_VERTEX_P(_v) ? 4 : V6; }
};
typedef counting_iterator<int> VertexIterator;
namespace boost {
+ class Graph { }; // this is a dummy as our graph has no actual representation
+
// We make Graph a model of various BGL Graph concepts.
// This mainly means that graph_traits<Graph> has lots of stuff.
public virtual vertex_list_graph_tag,
public virtual edge_list_graph_tag { };
+ template<>
struct graph_traits<Graph> {
// Concept Graph:
typedef int vertex_descriptor; /* vertex number, -1 => none */
}
// Concept VertexListGraph:
- inline std::pair<VertexIterator,VertexIterator> vertices(const Graph&) {
+ inline
+ std::pair<VertexIterator,VertexIterator> vertices(const Graph&) {
return std::make_pair(VertexIterator(0), VertexIterator(N));
}
inline unsigned num_vertices(const Graph&) { return N; }
*/
static const double d2_epsilon= 1e-6;
- double edge_weights[N*V6], vertex_distances[N], total_cost=0;
+ double edge_weights[V6<<ESHIFT], vertex_distances[N], total_cost=0;
int v1,v2,e,f;
FOR_VERTEX(v1)