1
Fork 0
turbonss/cxxmph/trigraph.cc

82 lines
2.4 KiB
C++
Raw Normal View History

#include <cassert>
2010-10-05 17:51:17 +03:00
#include <limits>
2010-10-28 03:17:09 +03:00
#include <iostream>
2010-10-05 17:51:17 +03:00
2010-09-10 10:07:06 +03:00
#include "trigraph.h"
2010-10-28 03:17:09 +03:00
using std::cerr;
using std::endl;
2010-10-05 17:51:17 +03:00
using std::vector;
2010-09-10 10:07:06 +03:00
namespace {
2010-11-09 02:02:18 +02:00
static const cmph_uint32 kInvalidEdge = std::numeric_limits<cmph_uint32>::max();
2010-09-10 10:07:06 +03:00
}
namespace cxxmph {
2010-10-28 03:17:09 +03:00
TriGraph::TriGraph(cmph_uint32 nvertices, cmph_uint32 nedges)
2010-09-10 10:07:06 +03:00
: nedges_(0),
2010-10-05 17:51:17 +03:00
edges_(nedges),
2010-10-28 03:17:09 +03:00
next_edge_(nedges),
2010-09-10 10:07:06 +03:00
first_edge_(nvertices, kInvalidEdge),
vertex_degree_(nvertices, 0) { }
void TriGraph::ExtractEdgesAndClear(vector<Edge>* edges) {
vector<Edge>().swap(next_edge_);
2010-10-05 17:51:17 +03:00
vector<cmph_uint32>().swap(first_edge_);
vector<cmph_uint8>().swap(vertex_degree_);
2010-09-10 10:07:06 +03:00
nedges_ = 0;
edges->swap(edges_);
}
void TriGraph::AddEdge(const Edge& edge) {
2010-10-28 03:17:09 +03:00
edges_[nedges_] = edge;
assert(first_edge_.size() > edge[0]);
assert(first_edge_.size() > edge[1]);
assert(first_edge_.size() > edge[0]);
assert(first_edge_.size() > edge[1]);
assert(first_edge_.size() > edge[2]);
assert(next_edge_.size() > nedges_);
next_edge_[nedges_] = Edge(
first_edge_[edge[0]], first_edge_[edge[1]], first_edge_[edge[2]]);
first_edge_[edge[0]] = first_edge_[edge[1]] = first_edge_[edge[2]] = nedges_;
++vertex_degree_[edge[0]];
++vertex_degree_[edge[1]];
++vertex_degree_[edge[2]];
++nedges_;
}
void TriGraph::RemoveEdge(cmph_uint32 current_edge) {
2010-10-28 03:17:09 +03:00
cerr << "Removing edge " << current_edge << " from " << nedges_ << " existing edges " << endl;
for (int i = 0; i < 3; ++i) {
cmph_uint32 vertex = edges_[current_edge][i];
cmph_uint32 edge1 = first_edge_[vertex];
cmph_uint32 edge2 = kInvalidEdge;
cmph_uint32 j = 0;
while (edge1 != current_edge && edge1 != kInvalidEdge) {
edge2 = edge1;
if (edges_[edge1][0] == vertex) j = 0;
else if (edges_[edge1][1] == vertex) j = 1;
else j = 2;
edge1 = next_edge_[edge1][j];
}
assert(edge1 != kInvalidEdge);
if (edge2 != kInvalidEdge) next_edge_[edge2][j] = next_edge_[edge1][i];
else first_edge_[vertex] = next_edge_[edge1][i];
--vertex_degree_[vertex];
}
}
2010-11-09 02:02:18 +02:00
void TriGraph::DebugGraph() const {
int i;
for(i = 0; i < edges_.size(); i++){
cerr << i << " " << edges_[i][0] << " " << edges_[i][1] << " " << edges_[i][2]
<< " nexts " << next_edge_[i][0] << " " << next_edge_[i][1] << " " << next_edge_[i][2] << endl;
}
for(i = 0; i < first_edge_.size();i++){
cerr << "first for vertice " <<i << " " << first_edge_[i] << endl;
}
}
} // namespace cxxmph