dmatetelki
|
41390ded4b
|
refactor, MarchingSquares::visitPoint
|
10 years ago |
|
dmatetelki
|
6ae29c63ba
|
Following horizontal/vertical lines
|
10 years ago |
|
dmatetelki
|
5e0c885673
|
refactoring MarchingSquares::RunMarchingSquares, merging lines part2, not using direction vectors, but following the vertical/horizontal line till possible.
|
10 years ago |
|
dmatetelki
|
31263b73cc
|
refactoring MarchingSquares::RunMarchingSquares, merging lines part1
|
10 years ago |
|
dmatetelki
|
38e0d49417
|
Marching squares: borders are solid.
|
10 years ago |
|
dmatetelki
|
c2805b5cd8
|
Marching squares: shifted center is 0.5,0.5 instead of 0,0
|
10 years ago |
|
dmatetelki
|
d829f72125
|
removing MarchingSquares::dumpLinesToHtml
|
10 years ago |
|
dmatetelki
|
df2155345f
|
Marching squares.
|
10 years ago |
|
dmatetelki
|
4f3f30d24b
|
Node has m_radius
|
10 years ago |
|
dmatetelki
|
2728f36c25
|
refactoring, moving out GraphWidget::modifyRoute
|
10 years ago |
|
dmatetelki
|
91972ea943
|
GraphWidget has background png
|
10 years ago |
|
dmatetelki
|
9c85a9459f
|
pathFromPrevList fixed
|
10 years ago |
|
dmatetelki
|
b02fc27390
|
test_graph_algorithms.hpp, dijkstra is fixed
|
10 years ago |
|
dmatetelki
|
5160549dc9
|
Graph all locals are auto typed.
|
10 years ago |
|
dmatetelki
|
9787a9c013
|
refactoring Graph::modifyVertex
|
10 years ago |
|
dmatetelki
|
b41eb87246
|
refactoring Graph::removeVertex
|
10 years ago |
|
dmatetelki
|
e8c071a976
|
No check needed when adding a new vertex, as unordered_map::insert won't do anything if key exists.
|
10 years ago |
|
dmatetelki
|
1809980c28
|
Graph: no self edges, no multiedges.
|
10 years ago |
|
dmatetelki
|
1d018ba09a
|
Some functions become free functions.
|
10 years ago |
|
dmatetelki
|
81688e7b5b
|
floats.hpp: adding missing init lists to some def. ctors
|
10 years ago |
Denes Matetelki
|
dfdbe65c5b
|
Using dijkstra, buggy.
|
10 years ago |
|
Denes Matetelki
|
18afa617b3
|
Updating dijkstra_shortest_path_to, seems buggy.
|
10 years ago |
|
dmatetelki
|
7b3e960f4a
|
Adding graph_algorithms.hpp with dijkstra_shortest_path_to
|
11 years ago |
|
dmatetelki
|
72833b8974
|
Fixing copy+paste error
|
11 years ago |
|
dmatetelki
|
3b4f58467f
|
refactorign of the remove/insert node/edge
|
11 years ago |
|
dmatetelki
|
a9e9fbf940
|
removing edges
|
11 years ago |
|
dmatetelki
|
fa15a7c30a
|
Adding/removing nodes, adding edges.
|
11 years ago |
|
dmatetelki
|
7f068f8ffd
|
can add node to selected node with the insert key
|
11 years ago |
|
dmatetelki
|
abe35ea720
|
small refoctoring of graph_xml.hpp
|
11 years ago |
|
dmatetelki
|
228ee6505d
|
small cleanups, itemAt fix with Map
|
11 years ago |
|
dmatetelki
|
de42d1f3ae
|
qtgraph loads/saves state to graph
|
11 years ago |
|
dmatetelki
|
738b6ce345
|
graph has modifyVertex member
|
11 years ago |
|
dmatetelki
|
5c610fff0b
|
Qt visualization of graph, from the Elastic Nodes Example
|
11 years ago |
|
dmatetelki
|
684e953c3b
|
new function: modifyVertex, internal edgecontainer is a typedef
|
11 years ago |
|
dmatetelki
|
d3ecd5f49d
|
priority_queue.hpp with ineffective modifyKey
|
11 years ago |
|
dmatetelki
|
801a55b265
|
new graph_xml.hpp file to read (with libxml/parser) and write to XML
|
11 years ago |
|
dmatetelki
|
c89e0bfc3a
|
Graph stands for not weighed, not directed graph.
|
11 years ago |
|
dmatetelki
|
5003147e28
|
graph.hpp renamed to graphwd.hpp
|
11 years ago |
|
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 |
