1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499
|
//***************************************************************************
//* Copyright (c) 2015 Saint Petersburg State University
//* Copyright (c) 2011-2014 Saint Petersburg Academic University
//* All Rights Reserved
//* See file LICENSE for details.
//***************************************************************************
#pragma once
#include <vector>
#include <set>
#include <cstring>
#include "utils/logger/logger.hpp"
#include "graph_core.hpp"
#include "graph_iterators.hpp"
namespace omnigraph {
using std::vector;
using std::set;
template<class DataMaster>
class ObservableGraph: public GraphCore<DataMaster> {
public:
typedef GraphCore<DataMaster> base;
typedef typename base::DataMasterT DataMasterT;
typedef typename base::VertexData VertexData;
typedef typename base::EdgeData EdgeData;
typedef typename base::EdgeId EdgeId;
typedef typename base::VertexId VertexId;
typedef typename base::VertexIt VertexIt;
typedef typename base::edge_const_iterator edge_const_iterator;
typedef HandlerApplier<VertexId, EdgeId> Applier;
typedef SmartVertexIterator<ObservableGraph> SmartVertexIt;
typedef SmartEdgeIterator<ObservableGraph> SmartEdgeIt;
typedef ConstEdgeIterator<ObservableGraph> ConstEdgeIt;
typedef ActionHandler<VertexId, EdgeId> Handler;
private:
//todo switch to smart iterators
mutable std::vector<Handler*> action_handler_list_;
const HandlerApplier<VertexId, EdgeId> *applier_;
public:
//todo move to graph core
typedef ConstructionHelper<DataMaster> HelperT;
HelperT GetConstructionHelper() {
// TODO: fix everything and restore this check
// VERIFY(this->VerifyAllDetached());
return HelperT(*this);
}
const Applier& GetHandlerApplier() const {
return *applier_;
}
void AddActionHandler(Handler* action_handler) const;
bool RemoveActionHandler(const Handler* action_handler) const;
bool AllHandlersThreadSafe() const;
// TODO: for debug. remove.
void PrintHandlersNames() const;
//todo make Fire* protected once again with helper friend class
void FireAddVertex(VertexId v) const;
void FireAddEdge(EdgeId e) const;
void FireDeleteVertex(VertexId v) const;
void FireDeleteEdge(EdgeId e) const;
void FireMerge(std::vector<EdgeId> old_edges, EdgeId new_edge) const;
void FireGlue(EdgeId new_edge, EdgeId edge1, EdgeId edge2) const;
void FireSplit(EdgeId edge, EdgeId new_edge1, EdgeId new_edge2) const;
bool VerifyAllDetached();
//smart iterators
template<typename Comparator>
SmartVertexIterator<ObservableGraph, Comparator> SmartVertexBegin(
const Comparator& comparator, bool canonical_only = false) const {
return SmartVertexIterator<ObservableGraph, Comparator>(*this,
comparator, canonical_only);
}
SmartVertexIterator<ObservableGraph> SmartVertexBegin(bool canonical_only = false) const {
return SmartVertexIterator<ObservableGraph>(*this, std::less<VertexId>(), canonical_only);
}
template<typename Comparator>
SmartEdgeIterator<ObservableGraph, Comparator> SmartEdgeBegin(
const Comparator& comparator, bool canonical_only = false) const {
return SmartEdgeIterator<ObservableGraph, Comparator>(*this, comparator, canonical_only);
}
SmartEdgeIterator<ObservableGraph> SmartEdgeBegin(bool canonical_only = false) const {
return SmartEdgeIterator<ObservableGraph>(*this, std::less<EdgeId>(), canonical_only);
}
ConstEdgeIterator<ObservableGraph> ConstEdgeBegin(bool canonical_only = false) const {
return ConstEdgeIterator<ObservableGraph>(*this, canonical_only);
}
void FireDeletePath(const std::vector<EdgeId>& edges_to_delete, const std::vector<VertexId>& vertices_to_delete) const;
ObservableGraph(const DataMaster& master) :
base(master), applier_(new PairedHandlerApplier<ObservableGraph>(*this)) {
}
virtual ~ObservableGraph();
/////////////////////////graph operations
//adding/removing vertices and edges
VertexId AddVertex(const VertexData& data) {
return AddVertex(data, GetGraphIdDistributor());
}
VertexId AddVertex(const VertexData& data, restricted::IdDistributor& id_distributor);
void DeleteVertex(VertexId v);
void ForceDeleteVertex(VertexId v);
using base::GetGraphIdDistributor;
using base::conjugate;
EdgeId AddEdge(const EdgeData &data) {
return AddEdge(data, GetGraphIdDistributor());
}
EdgeId AddEdge(const EdgeData& data, restricted::IdDistributor& id_distributor);
EdgeId AddEdge(VertexId v1, VertexId v2, const EdgeData &data) {
return AddEdge(v1, v2, data, GetGraphIdDistributor());
}
EdgeId AddEdge(VertexId v1, VertexId v2, const EdgeData& data, restricted::IdDistributor& id_distributor);
void DeleteEdge(EdgeId e);
void DeleteAllOutgoing(VertexId v);
void DeleteAllIncoming(VertexId v);
void CompressVertex(VertexId v);
EdgeId UnsafeCompressVertex(VertexId v);
std::vector<EdgeId> EdgesToDelete(const std::vector<EdgeId>& path) const;
std::vector<VertexId> VerticesToDelete(const std::vector<EdgeId>& path) const;
std::vector<EdgeId> CorrectMergePath(const std::vector<EdgeId>& path) const;
EdgeId MergePath(const std::vector<EdgeId>& path, bool safe_merging = true);
std::pair<EdgeId, EdgeId> SplitEdge(EdgeId edge, size_t position);
EdgeId GlueEdges(EdgeId edge1, EdgeId edge2);
private:
DECL_LOGGER("ObservableGraph")
};
template<class DataMaster>
typename ObservableGraph<DataMaster>::VertexId ObservableGraph<DataMaster>::AddVertex(const VertexData& data, restricted::IdDistributor& id_distributor) {
VertexId v = base::HiddenAddVertex(data, id_distributor);
FireAddVertex(v);
return v;
}
template<class DataMaster>
void ObservableGraph<DataMaster>::DeleteVertex(VertexId v) {
VERIFY(base::IsDeadEnd(v) && base::IsDeadStart(v));
VERIFY(v != VertexId());
FireDeleteVertex(v);
base::HiddenDeleteVertex(v);
}
template<class DataMaster>
void ObservableGraph<DataMaster>::ForceDeleteVertex(VertexId v) {
DeleteAllOutgoing(v);
DeleteAllIncoming(v);
DeleteVertex(v);
}
template<class DataMaster>
typename ObservableGraph<DataMaster>::EdgeId ObservableGraph<DataMaster>::AddEdge(VertexId v1, VertexId v2, const EdgeData& data, restricted::IdDistributor& id_distributor) {
EdgeId e = base::HiddenAddEdge(v1, v2, data, id_distributor);
FireAddEdge(e);
return e;
}
template<class DataMaster>
typename ObservableGraph<DataMaster>::EdgeId ObservableGraph<DataMaster>::AddEdge(const EdgeData& data, restricted::IdDistributor& id_distributor) {
EdgeId e = base::HiddenAddEdge(data, id_distributor);
FireAddEdge(e);
return e;
}
template<class DataMaster>
void ObservableGraph<DataMaster>::DeleteEdge(EdgeId e) {
FireDeleteEdge(e);
base::HiddenDeleteEdge(e);
}
template<class DataMaster>
void ObservableGraph<DataMaster>::DeleteAllOutgoing(VertexId v) {
while (base::OutgoingEdgeCount(v) > 0) {
EdgeId edge = *base::out_begin(v);
DeleteEdge(edge);
}
}
template<class DataMaster>
void ObservableGraph<DataMaster>::DeleteAllIncoming(VertexId v) {
while (base::IncomingEdgeCount(v) > 0) {
EdgeId edge = *base::in_begin(v);
DeleteEdge(edge);
}
}
template<class DataMaster>
void ObservableGraph<DataMaster>::CompressVertex(VertexId v) {
//VERIFY(CanCompressVertex(v));
if (base::CanCompressVertex(v)) {
UnsafeCompressVertex(v);
} else {
TRACE("Vertex " << base::str(v) << " can't be compressed");
}
}
template<class DataMaster>
typename ObservableGraph<DataMaster>::EdgeId ObservableGraph<DataMaster>::UnsafeCompressVertex(VertexId v) {
VERIFY(base::CanCompressVertex(v));
std::vector<EdgeId> edges_to_merge;
edges_to_merge.push_back(base::GetUniqueIncomingEdge(v));
edges_to_merge.push_back(base::GetUniqueOutgoingEdge(v));
return MergePath(edges_to_merge);
}
template<class DataMaster>
std::vector<typename ObservableGraph<DataMaster>::EdgeId> ObservableGraph<DataMaster>::EdgesToDelete(const std::vector<EdgeId>& path) const {
std::set<EdgeId> edgesToDelete;
edgesToDelete.insert(path[0]);
for (size_t i = 0; i + 1 < path.size(); i++) {
EdgeId e = path[i + 1];
if (edgesToDelete.find(base::conjugate(e)) == edgesToDelete.end())
edgesToDelete.insert(e);
}
return std::vector<EdgeId>(edgesToDelete.begin(), edgesToDelete.end());
}
template<class DataMaster>
vector<typename ObservableGraph<DataMaster>::VertexId> ObservableGraph<DataMaster>::VerticesToDelete(const vector<EdgeId>& path) const {
std::set<VertexId> verticesToDelete;
for (size_t i = 0; i + 1 < path.size(); i++) {
EdgeId e = path[i + 1];
VertexId v = base::EdgeStart(e);
if (verticesToDelete.find(base::conjugate(v)) == verticesToDelete.end())
verticesToDelete.insert(v);
}
return vector<VertexId>(verticesToDelete.begin(), verticesToDelete.end());
}
template<class DataMaster>
void ObservableGraph<DataMaster>::AddActionHandler(Handler* action_handler) const {
#pragma omp critical(action_handler_list_modification)
{
TRACE("Action handler " << action_handler->name() << " added");
if (find(action_handler_list_.begin(), action_handler_list_.end(), action_handler) != action_handler_list_.end()) {
VERIFY_MSG(false, "Action handler " << action_handler->name() << " has already been added");
} else {
action_handler_list_.push_back(action_handler);
}
}
}
template<class DataMaster>
bool ObservableGraph<DataMaster>::RemoveActionHandler(const Handler* action_handler) const {
bool result = false;
#pragma omp critical(action_handler_list_modification)
{
auto it = std::find(action_handler_list_.begin(), action_handler_list_.end(), action_handler);
if (it != action_handler_list_.end()) {
action_handler_list_.erase(it);
TRACE("Action handler " << action_handler->name() << " removed");
result = true;
} else {
TRACE("Action handler " << action_handler->name() << " wasn't found among graph action handlers");
}
}
return result;
}
template<class DataMaster>
bool ObservableGraph<DataMaster>::AllHandlersThreadSafe() const {
for (Handler* handler : action_handler_list_) {
if (handler->IsAttached() && !handler->IsThreadSafe()) {
return false;
}
}
return true;
}
template<class DataMaster>
void ObservableGraph<DataMaster>::PrintHandlersNames() const {
for (Handler* handler : action_handler_list_) {
std::cout << handler->name() << " attached=" << handler->IsAttached() << std::endl;
}
}
template<class DataMaster>
void ObservableGraph<DataMaster>::FireAddVertex(VertexId v) const {
for (Handler* handler_ptr : action_handler_list_) {
if (handler_ptr->IsAttached()) {
TRACE("FireAddVertex to handler " << handler_ptr->name());
applier_->ApplyAdd(*handler_ptr, v);
}
}
}
template<class DataMaster>
void ObservableGraph<DataMaster>::FireAddEdge(EdgeId e) const {
for (Handler* handler_ptr : action_handler_list_) {
if (handler_ptr->IsAttached()) {
TRACE("FireAddEdge to handler " << handler_ptr->name());
applier_->ApplyAdd(*handler_ptr, e);
}
}
}
template<class DataMaster>
void ObservableGraph<DataMaster>::FireDeleteVertex(VertexId v) const {
for (auto it = action_handler_list_.rbegin(); it != action_handler_list_.rend(); ++it) {
if ((*it)->IsAttached()) {
applier_->ApplyDelete(**it, v);
}
}
}
template<class DataMaster>
void ObservableGraph<DataMaster>::FireDeleteEdge(EdgeId e) const {
for (auto it = action_handler_list_.rbegin(); it != action_handler_list_.rend(); ++it) {
if ((*it)->IsAttached()) {
applier_->ApplyDelete(**it, e);
}
};
}
template<class DataMaster>
void ObservableGraph<DataMaster>::FireMerge(vector<EdgeId> old_edges, EdgeId new_edge) const {
for (Handler* handler_ptr : action_handler_list_) {
if (handler_ptr->IsAttached()) {
applier_->ApplyMerge(*handler_ptr, old_edges, new_edge);
}
}
}
template<class DataMaster>
void ObservableGraph<DataMaster>::FireGlue(EdgeId new_edge, EdgeId edge1, EdgeId edge2) const {
for (Handler* handler_ptr : action_handler_list_) {
if (handler_ptr->IsAttached()) {
applier_->ApplyGlue(*handler_ptr, new_edge, edge1, edge2);
}
};
}
template<class DataMaster>
void ObservableGraph<DataMaster>::FireSplit(EdgeId edge, EdgeId new_edge1, EdgeId new_edge2) const {
for (Handler* handler_ptr : action_handler_list_) {
if (handler_ptr->IsAttached()) {
applier_->ApplySplit(*handler_ptr, edge, new_edge1, new_edge2);
}
}
}
template<class DataMaster>
bool ObservableGraph<DataMaster>::VerifyAllDetached() {
for (Handler* handler_ptr : action_handler_list_) {
if (handler_ptr->IsAttached()) {
return false;
}
}
return true;
}
template<class DataMaster>
void ObservableGraph<DataMaster>::FireDeletePath(const vector<EdgeId>& edgesToDelete, const vector<VertexId>& verticesToDelete) const {
for (auto it = edgesToDelete.begin(); it != edgesToDelete.end(); ++it)
FireDeleteEdge(*it);
for (auto it = verticesToDelete.begin(); it != verticesToDelete.end(); ++it)
FireDeleteVertex(*it);
}
template<class DataMaster>
ObservableGraph<DataMaster>::~ObservableGraph<DataMaster>() {
while (base::size() > 0) {
ForceDeleteVertex(*base::begin());
}
}
template<class DataMaster>
vector<typename ObservableGraph<DataMaster>::EdgeId> ObservableGraph<DataMaster>::CorrectMergePath(const vector<EdgeId>& path) const {
for (size_t i = 0; i < path.size(); i++) {
if (path[i] == base::conjugate(path[i])) {
vector<EdgeId> result;
if (i < path.size() - 1 - i) {
for (size_t j = 0; j < path.size(); j++)
result.push_back(base::conjugate(path[path.size() - 1 - j]));
i = path.size() - 1 - i;
} else {
result = path;
}
size_t size = 2 * i + 1;
for (size_t j = result.size(); j < size; j++) {
result.push_back(base::conjugate(result[size - 1 - j]));
}
return result;
}
}
return path;
}
template<class DataMaster>
typename ObservableGraph<DataMaster>::EdgeId ObservableGraph<DataMaster>::MergePath(const vector<EdgeId>& path, bool safe_merging) {
VERIFY(!path.empty());
for (size_t i = 0; i < path.size(); i++)
for (size_t j = i + 1; j < path.size(); j++) {
VERIFY(path[i] != path[j]);
}
if (path.size() == 1) {
TRACE(
"Path of single edge " << base::str(*(path.begin())) << ". Nothing to merge.");
};
// cerr << "Merging " << PrintDetailedPath(pObservableGraph<DataMaster><VertexIdT, EdgeIdT, VertexIt>ath) << endl;
// cerr << "Conjugate " << PrintConjugatePath(path) << endl;
vector<EdgeId> corrected_path = CorrectMergePath(path);
VertexId v1 = base::EdgeStart(corrected_path[0]);
VertexId v2 = base::EdgeEnd(corrected_path[corrected_path.size() - 1]);
vector<const EdgeData*> to_merge;
for (auto it = corrected_path.begin(); it != corrected_path.end(); ++it) {
to_merge.push_back(&(base::data(*it)));
}
EdgeId new_edge = base::HiddenAddEdge(v1, v2, base::master().MergeData(to_merge, safe_merging));
FireMerge(corrected_path, new_edge);
vector<EdgeId> edges_to_delete = EdgesToDelete(corrected_path);
vector<VertexId> vertices_to_delete = VerticesToDelete(corrected_path);
FireDeletePath(edges_to_delete, vertices_to_delete);
FireAddEdge(new_edge);
base::HiddenDeletePath(edges_to_delete, vertices_to_delete);
return new_edge;
}
template<class DataMaster>
std::pair<typename ObservableGraph<DataMaster>::EdgeId, typename ObservableGraph<DataMaster>::EdgeId> ObservableGraph<DataMaster>::SplitEdge(EdgeId edge, size_t position) {
bool sc_flag = (edge == conjugate(edge));
VERIFY_MSG(position > 0 && position < (sc_flag ? base::length(edge) / 2 + 1 : base::length(edge)),
"Edge length is " << base::length(edge) << " but split pos was " << position);
std::pair<VertexData, std::pair<EdgeData, EdgeData> > newData = base::master().SplitData(base::data(edge), position, sc_flag);
VertexId splitVertex = base::HiddenAddVertex(newData.first);
EdgeId new_edge1 = base::HiddenAddEdge(base::EdgeStart(edge), splitVertex, newData.second.first);
EdgeId new_edge2 = base::HiddenAddEdge(splitVertex, sc_flag ? conjugate(splitVertex) : base::EdgeEnd(edge), newData.second.second);
VERIFY(!sc_flag || new_edge2 == conjugate(new_edge2))
FireSplit(edge, new_edge1, new_edge2);
FireDeleteEdge(edge);
FireAddVertex(splitVertex);
FireAddEdge(new_edge1);
FireAddEdge(new_edge2);
base::HiddenDeleteEdge(edge);
return std::make_pair(new_edge1, new_edge2);
}
template<class DataMaster>
typename ObservableGraph<DataMaster>::EdgeId ObservableGraph<DataMaster>::GlueEdges(EdgeId edge1, EdgeId edge2) {
EdgeId new_edge = base::HiddenAddEdge(base::EdgeStart(edge2), base::EdgeEnd(edge2), base::master().GlueData(base::data(edge1), base::data(edge2)));
FireGlue(new_edge, edge1, edge2);
FireDeleteEdge(edge1);
FireDeleteEdge(edge2);
FireAddEdge(new_edge);
VertexId start = base::EdgeStart(edge1);
VertexId end = base::EdgeEnd(edge1);
base::HiddenDeleteEdge(edge1);
base::HiddenDeleteEdge(edge2);
if (base::IsDeadStart(start) && base::IsDeadEnd(start)) {
DeleteVertex(start);
}
if (base::IsDeadStart(end) && base::IsDeadEnd(end)) {
DeleteVertex(end);
}
return new_edge;
}
}
|