dmatetelki
|
31806b22b9
|
Renaming Graph to GraphWD, adding tests.
|
11 years ago |
|
dmatetelki
|
5a12ecf6cf
|
removing unnecessary edge_iterator
|
11 years ago |
|
dmatetelki
|
fa7c830ff6
|
switching to unordered_map
|
11 years ago |
|
dmatetelki
|
72630c3d6b
|
std::vector iterators get invalidated at grow
|
11 years ago |
|
dmatetelki
|
6a75b25edb
|
rewriting for_each loops to range-for loops where at possible parallel version threads would access the same variable.
|
11 years ago |
|
dmatetelki
|
75614e1245
|
init list ctors; no more exceptions, adding missing vertices inseat and returning empty list on non-existing vertices
|
11 years ago |
|
dmatetelki
|
1f8583f1ca
|
TToStr to create meaningful exception what messages.
|
11 years ago |
|
dmatetelki
|
92c7e326c9
|
Throwing VertexAlreadyExistsExcepttion and VertexDoesNotExistExcepttion instead of returning false.
|
11 years ago |
|
dmatetelki
|
687c9cc1a7
|
refactoring (*it).member to it->member
|
11 years ago |
|
dmatetelki
|
3e28a3a7d5
|
Edge stores value_type not iterator.
|
11 years ago |
|
dmatetelki
|
e4b9b94e39
|
adjusting iterators after deletion
|
11 years ago |
|
dmatetelki
|
37862e6242
|
moved from internal pointers to iterators
|
11 years ago |
|
dmatetelki
|
b19eda3a48
|
fixing the removal of edges
|
11 years ago |
|
dmatetelki
|
53f5f14af6
|
std::accumulate works in parallel.
|
11 years ago |
|
dmatetelki
|
81239895ad
|
adding todos, for_each to access 1 reduct variable is not parallel wise
|
11 years ago |
|
dmatetelki
|
e57077d305
|
const E& -> typedef const_weight_reference
|
11 years ago |
|
dmatetelki
|
60648866a5
|
E -> const E&
|
11 years ago |
|
dmatetelki
|
4a0843ed82
|
Removing the allocators.
|
11 years ago |
Denes Matetelki
|
fda1305c05
|
small refactor
|
12 years ago |
|
Denes Matetelki
|
aa812cefda
|
file restructures to be mergeable with project-seed
|
12 years ago |
