deba [Thu, 27 Apr 2006 14:53:23 +0000] rev 2067
Tabu Search by Szabadkai Mark
ladanyi [Thu, 27 Apr 2006 13:10:23 +0000] rev 2066
added scrollbars to the canvas
ladanyi [Thu, 27 Apr 2006 12:20:09 +0000] rev 2065
filter loop edges
deba [Tue, 25 Apr 2006 14:48:50 +0000] rev 2064
Bug fix in findUEdge
ladanyi [Tue, 18 Apr 2006 22:59:33 +0000] rev 2063
id->label
alpar [Tue, 18 Apr 2006 13:25:41 +0000] rev 2062
Also check mingw compatibility
deba [Tue, 18 Apr 2006 09:14:38 +0000] rev 2061
Bug fix
Add missing function
deba [Tue, 18 Apr 2006 07:03:12 +0000] rev 2060
Images into the algorithm groups
deba [Tue, 18 Apr 2006 07:02:32 +0000] rev 2059
Doc fix
deba [Tue, 18 Apr 2006 07:01:55 +0000] rev 2058
Refinements in bipartite matching algorithms
ladanyi [Fri, 14 Apr 2006 23:55:36 +0000] rev 2057
added missing glibc2.m4
ladanyi [Fri, 14 Apr 2006 22:01:02 +0000] rev 2056
downgrade to gettext 0.14.2
ladanyi [Fri, 14 Apr 2006 18:53:56 +0000] rev 2055
po update
ladanyi [Fri, 14 Apr 2006 18:35:55 +0000] rev 2054
bugfix
ladanyi [Fri, 14 Apr 2006 18:31:50 +0000] rev 2053
distribute m4/*.m4
ladanyi [Fri, 14 Apr 2006 18:31:16 +0000] rev 2052
some reorganization
deba [Fri, 14 Apr 2006 18:07:33 +0000] rev 2051
MaxWeightedBipartiteMatching
MinCostMaxBipartiteMatching
Both algorithms are based on successive shortest
path algorithm with dijkstra shortest path
finding
deba [Fri, 14 Apr 2006 18:05:02 +0000] rev 2050
Changing the mining of the clear in heaps
It does not touch the heap cross ref. It is
sometimes more clean useable and more efficient
ladanyi [Fri, 14 Apr 2006 15:05:51 +0000] rev 2049
bugfix
ladanyi [Fri, 14 Apr 2006 14:57:59 +0000] rev 2048
make distcheck should work now
ladanyi [Thu, 13 Apr 2006 18:09:34 +0000] rev 2047
Removed a 0x00 byte which confused the file utility.
klao [Thu, 13 Apr 2006 17:57:03 +0000] rev 2046
more explicit :)
klao [Thu, 13 Apr 2006 17:22:17 +0000] rev 2045
path.h: bugfix, returning reference to a temporary
ladanyi [Wed, 12 Apr 2006 20:50:35 +0000] rev 2044
svn:ignore
ladanyi [Wed, 12 Apr 2006 20:38:22 +0000] rev 2043
revert to single configure scheme
deba [Fri, 07 Apr 2006 09:54:35 +0000] rev 2042
New Algorithm group for matchings
LaTeX formulas
Bug fix => ///\f$ will cause parsing error in doxygen
deba [Fri, 07 Apr 2006 09:52:30 +0000] rev 2041
Forgotten functions in the graph adaptor extenders.
deba [Fri, 07 Apr 2006 09:51:23 +0000] rev 2040
Bipartite Graph Max Cardinality Matching (Hopcroft-Karp)
Test for it
Some BpUgraph improvments
deba [Thu, 06 Apr 2006 09:33:29 +0000] rev 2039
Commiting The DynamicAsymMatrixMap from Nagy Jano
+ MatrixMapTraits
deba [Tue, 04 Apr 2006 17:45:35 +0000] rev 2038
LinearHeap is renamed to BucketHeap which is more conform
and widely used name for this data structure
deba [Tue, 04 Apr 2006 17:43:23 +0000] rev 2037
Doxygen log corrections
doc of ResGraphAdaptor has a bug in graph_adaptor.h
deba [Tue, 04 Apr 2006 10:40:02 +0000] rev 2036
The algorithm does not change the capacity and the flow in the resgraph
deba [Mon, 03 Apr 2006 19:47:37 +0000] rev 2035
More mingw compatibility
Implementation of the drand48 functions
deba [Mon, 03 Apr 2006 16:34:23 +0000] rev 2034
Edmonds-Karp MaxFlow
ResGraphAdaptor with Tolerance
deba [Mon, 03 Apr 2006 16:05:26 +0000] rev 2033
Small corrections
deba [Mon, 03 Apr 2006 16:03:37 +0000] rev 2032
Writeable extension of some maps
deba [Mon, 03 Apr 2006 09:45:23 +0000] rev 2031
Correcting the structure of the graph's and adaptor's map.
The template assign operators and map iterators can be used for adaptors also.
Some bugfix in the adaptors
New class SwapBpUGraphAdaptor which swaps the two nodeset of the graph.
deba [Mon, 03 Apr 2006 09:24:38 +0000] rev 2030
Naming convention fix
deba [Mon, 03 Apr 2006 08:41:52 +0000] rev 2029
Count ANodes-BNodes
deba [Fri, 31 Mar 2006 12:51:44 +0000] rev 2028
MinGW32 compatibility
deba [Fri, 31 Mar 2006 12:12:06 +0000] rev 2027
MinGW compatibility fix
deba [Fri, 31 Mar 2006 12:04:48 +0000] rev 2026
NaN checking to be conform to MinGW32
deba [Fri, 31 Mar 2006 11:10:44 +0000] rev 2025
Bugfix in the minimum cost arborescence algorithm
Dual solution computation and interface for algorithm
Optimality test on random graph
jacint [Thu, 30 Mar 2006 15:34:56 +0000] rev 2024
tolerance class incorporated
jacint [Thu, 30 Mar 2006 15:02:11 +0000] rev 2023
Unionfind changes induced some bugs here. Also some augmentations made.
alpar [Thu, 30 Mar 2006 09:42:05 +0000] rev 2022
docfix
deba [Thu, 30 Mar 2006 09:36:33 +0000] rev 2021
IncEdgeIt goes through on loop edges twice.
deba [Thu, 30 Mar 2006 08:38:41 +0000] rev 2020
Rewritten countItems and findEdges
deba [Mon, 27 Mar 2006 16:25:14 +0000] rev 2019
Adding todo to preflow
Some naming convention renamings
klao [Mon, 27 Mar 2006 16:09:54 +0000] rev 2018
missing ignore
deba [Mon, 27 Mar 2006 08:12:01 +0000] rev 2017
Minimum Cost Arborescence algorithm
deba [Mon, 27 Mar 2006 08:01:10 +0000] rev 2016
Doc rearrangement
Section readers moved to own group
klao [Fri, 24 Mar 2006 20:27:42 +0000] rev 2015
bootstrap: quiet option
ladanyi [Thu, 23 Mar 2006 20:43:25 +0000] rev 2014
ignore generated files
ladanyi [Thu, 23 Mar 2006 20:42:37 +0000] rev 2013
include fixes
ladanyi [Thu, 23 Mar 2006 19:57:14 +0000] rev 2012
- added gettext infrastructure to the gui
- the gui has a separate configure script now
- other minor changes
deba [Tue, 21 Mar 2006 13:45:24 +0000] rev 2011
Renaming files
klao [Fri, 17 Mar 2006 15:54:02 +0000] rev 2010
unused parameters fix
klao [Thu, 16 Mar 2006 13:52:12 +0000] rev 2009
rethrow fix
alpar [Wed, 15 Mar 2006 09:45:59 +0000] rev 2008
"Node shapes" added
alpar [Wed, 15 Mar 2006 09:45:10 +0000] rev 2007
Also check gcc-4.1
alpar [Wed, 15 Mar 2006 09:44:17 +0000] rev 2006
Spellcheck
klao [Fri, 10 Mar 2006 19:34:47 +0000] rev 2005
unionfind_test: double erase is not supported anymore
klao [Fri, 10 Mar 2006 18:17:37 +0000] rev 2004
UnionFindEnum: one remaining bug; removing commented out code
klao [Fri, 10 Mar 2006 18:06:26 +0000] rev 2003
UnionFindEnum revision:
* 0 is _not_ convertible to list<...>::iterator, so we have to use other means
to define/check validity
* standard LEMON iterator interface for ClassIt and ItemIt
deba [Wed, 08 Mar 2006 13:10:43 +0000] rev 2002
Omitting warning
deba [Tue, 07 Mar 2006 11:06:57 +0000] rev 2001
Removing obsolote "id" map handling
Error message is modified
deba [Mon, 06 Mar 2006 17:32:35 +0000] rev 2000
Checking missing section reader
deba [Mon, 06 Mar 2006 10:28:37 +0000] rev 1999
Clarifing alteration observing system
It is directly connected now to a container
deba [Mon, 06 Mar 2006 09:38:19 +0000] rev 1998
Bugfix in the hyper map
klao [Fri, 03 Mar 2006 21:49:39 +0000] rev 1997
Bugfix: an ugly artefact of the 'id' -> 'label' renaming
deba [Fri, 03 Mar 2006 12:35:32 +0000] rev 1996
Some documentation arrangement modification
deba [Thu, 02 Mar 2006 14:22:03 +0000] rev 1995
Bugfix in bpugraph
klao [Wed, 01 Mar 2006 17:37:25 +0000] rev 1994
bugfix: moving "invalid.h" down to "bits" broke autoconf
deba [Wed, 01 Mar 2006 13:19:28 +0000] rev 1993
utility, invalid and traits moved to bits
deba [Wed, 01 Mar 2006 12:46:52 +0000] rev 1992
UNDIRGRAPH_TYPEDEFS => UGRAPH_TYPEDEFS
deba [Wed, 01 Mar 2006 10:25:30 +0000] rev 1991
The graph adadptors can be alteration observed.
In most cases it uses the adapted graph alteration notifiers.
Only special case is now the UndirGraphAdaptor, where
we have to proxy the signals from the graph.
The SubBidirGraphAdaptor is removed, because it doest not
gives more feature than the EdgeSubGraphAdaptor<UndirGraphAdaptor<Graph>>.
The ResGraphAdaptor is based on this composition.
deba [Wed, 01 Mar 2006 10:17:25 +0000] rev 1990
Some classes assumed that the GraphMaps should be inherited
from an ObserverBase. These classes parents replaced with
DefaultMap which cause that the graph maps should not be
inherited from the ObserverBase.
deba [Wed, 01 Mar 2006 10:04:47 +0000] rev 1989
Traits for alteration notifiers
SplitGraph is temporarly deleted
deba [Wed, 01 Mar 2006 09:40:16 +0000] rev 1988
Bug fix
deba [Mon, 27 Feb 2006 15:43:25 +0000] rev 1987
Default constructor which allocates empty graphs
deba [Mon, 27 Feb 2006 10:36:01 +0000] rev 1986
An additional simplier interface for static size graphs.
Node operator()(int) for getting node by index
int index(Node node) for getting index by node
deba [Mon, 27 Feb 2006 10:17:33 +0000] rev 1985
Bug fix
deba [Fri, 24 Feb 2006 11:13:09 +0000] rev 1984
Bug fix
deba [Fri, 24 Feb 2006 11:02:11 +0000] rev 1983
Bugfix
deba [Thu, 23 Feb 2006 15:10:45 +0000] rev 1982
ListBpUGraph
deba [Thu, 23 Feb 2006 09:03:18 +0000] rev 1981
Little bugfixes, spellchecks and improvements
deba [Thu, 23 Feb 2006 08:55:54 +0000] rev 1980
Renaming to be convient to the naming of the adaptors
Concept checking of the ugraph adaptors
deba [Wed, 22 Feb 2006 18:26:56 +0000] rev 1979
Mergeing extendermerge branch
Changes:
the extender system
resize for static size graph
UGraphExtender => UndirectGraphExtender
UGraphExtenders with changed meaning
Some UGraphExtender /SubUGraphExtenders, DirectUGraphExtender/
GridGraph => GridUGraph
radix sort to ansi compatible
alpar [Wed, 22 Feb 2006 12:45:59 +0000] rev 1978
vmap.h: Enables one to create maps with a virtual base class.
alpar [Tue, 21 Feb 2006 12:37:00 +0000] rev 1977
RefPtr: a reference counted pointer class
alpar [Tue, 21 Feb 2006 08:48:11 +0000] rev 1976
Fix bug #26: Check if an edge is a loop and do not draw then
deba [Mon, 20 Feb 2006 09:40:07 +0000] rev 1975
Second renaming of min cut
Minimum => Min
Work => Aux
alpar [Mon, 20 Feb 2006 06:44:07 +0000] rev 1974
Public data members of xy became documented
alpar [Mon, 20 Feb 2006 06:43:08 +0000] rev 1973
Spellchecking
alpar [Mon, 20 Feb 2006 06:42:29 +0000] rev 1972
Dewarningification
alpar [Mon, 20 Feb 2006 06:41:12 +0000] rev 1971
- RGB color related stuff is in color.h now
- eps.h: A simple class to create .eps figures (demo: eps_demo.h)
alpar [Mon, 20 Feb 2006 06:38:18 +0000] rev 1970
Doc changes
alpar [Mon, 20 Feb 2006 06:32:15 +0000] rev 1969
One more step towards Undir -> U conversion...
deba [Tue, 14 Feb 2006 10:41:16 +0000] rev 1968
Name modification
deba [Mon, 13 Feb 2006 09:42:53 +0000] rev 1967
New algorithm:
MaxCardinalitySearch
MinimalCut // in UGraph
deba [Tue, 07 Feb 2006 09:32:55 +0000] rev 1966
Easier checking in DEBUG mode
I hope we should not test ArrayMap longer
The vector map checks its limits in debug mode what
helps us to find the bad memory accesses in the maps
deba [Tue, 07 Feb 2006 09:20:47 +0000] rev 1965
Compilation with G++ -ansi
deba [Mon, 06 Feb 2006 20:32:29 +0000] rev 1964
Bug fix
deba [Mon, 06 Feb 2006 17:00:41 +0000] rev 1963
Bug fix
deba [Mon, 06 Feb 2006 16:58:39 +0000] rev 1962
Bug fixes in ListEdgeSet
Added SmartEdgeSet
deba [Mon, 06 Feb 2006 15:52:32 +0000] rev 1961
Bug fix
alpar [Mon, 06 Feb 2006 09:11:53 +0000] rev 1960
- Increased max. number of iteration
- Better tests.
alpar [Mon, 06 Feb 2006 09:10:43 +0000] rev 1959
Spellcheck
alpar [Fri, 03 Feb 2006 17:32:25 +0000] rev 1958
- svn lock doesn't work
- fix bootstrap switch
alpar [Fri, 03 Feb 2006 17:21:21 +0000] rev 1957
Last struggle against Doxygen.
alpar [Fri, 03 Feb 2006 16:40:16 +0000] rev 1956
Unified copyright notices
alpar [Fri, 03 Feb 2006 16:11:08 +0000] rev 1955
Change the compilation flag at release make distcheck.
(This setting is probably indifferent, though.)
alpar [Fri, 03 Feb 2006 16:00:36 +0000] rev 1954
Minor change.
alpar [Fri, 03 Feb 2006 15:58:24 +0000] rev 1953
Polish the doc.
klao [Fri, 03 Feb 2006 14:22:45 +0000] rev 1952
graph_adaptor.h: spacing corrections in doc
klao [Fri, 03 Feb 2006 14:07:52 +0000] rev 1951
graph_adaptor.h: probably a doxygen bug: in tex formulas there should be
whitespace after the opening and before the closing \f$
klao [Fri, 03 Feb 2006 12:20:10 +0000] rev 1950
lp_cplex.cc: bugfix in _setColName, _getColName implemented
alpar [Fri, 03 Feb 2006 09:18:17 +0000] rev 1949
Fight with Doxygen.
Victory hasn't been reached yet, but it's on the horizon.
alpar [Fri, 03 Feb 2006 09:03:05 +0000] rev 1948
Hopefully we can release 0.5 today
alpar [Thu, 02 Feb 2006 18:13:18 +0000] rev 1947
minor changes
alpar [Thu, 02 Feb 2006 17:43:24 +0000] rev 1946
- workaround for a Doxygen 1.4.6 bug
- other doc fixes
klao [Thu, 02 Feb 2006 17:09:09 +0000] rev 1945
NEWS: major changes since 0.4 added
alpar [Thu, 02 Feb 2006 15:53:01 +0000] rev 1944
Use short icpc paths
ladanyi [Thu, 02 Feb 2006 15:44:45 +0000] rev 1943
Fix crash when an arrow is clicked with the delete tool.
klao [Thu, 02 Feb 2006 13:43:01 +0000] rev 1942
kruskal.h: an overloaded function for older, pointer-style iterators
alpar [Thu, 02 Feb 2006 08:52:20 +0000] rev 1941
The version tag of the trunk is svn-head
alpar [Thu, 02 Feb 2006 08:51:10 +0000] rev 1940
- also works off-line
- icc-8.0 in (not) tested, as well.
alpar [Thu, 02 Feb 2006 08:49:41 +0000] rev 1939
Towards icc-8.0 compatibility...
alpar [Wed, 01 Feb 2006 12:55:38 +0000] rev 1938
Fix g++-3.4 executable's name
alpar [Wed, 01 Feb 2006 11:33:16 +0000] rev 1937
Some useful scripts:
check-compiler: test whether the repo compiles warningless
with various compilers.
check-integrity: checks whether everything is svn-added,
the makefiles are correct etc.
release: creates a version numbered release. Is modifies the repository.
DO NOT PLAY WITH IT!
alpar [Tue, 31 Jan 2006 21:14:11 +0000] rev 1936
Fix icc compilation failures.
alpar [Tue, 31 Jan 2006 20:16:53 +0000] rev 1935
Spellcheck
deba [Tue, 31 Jan 2006 20:14:52 +0000] rev 1934
Bug fix
ANodeIt/BNodeIt should not be inherited from ANode/BNode
The reason:
assert(graph.id(ANodeIt(graph)) == graph.id((Node)ANodeIt(graph)));
deba [Tue, 31 Jan 2006 20:04:36 +0000] rev 1933
Revising the bpugraph concept
We need a public but very limited ANode and BNode class
It can be used with ItemSetTraits and with some special maps
By example:
DescriptorMap<Graph, ANode>
InvertableMap<Graph, ANode, string>
IterableBoolMap<Graph, ANode>
IterableIntMap<Graph, ANode>
IterableValueMap<Graph, ANode, string>
deba [Tue, 31 Jan 2006 19:57:35 +0000] rev 1932
Bug fix
friend does not declares type
deba [Tue, 31 Jan 2006 19:33:48 +0000] rev 1931
New iterable map with comparable values
it uses linked lists and balanced binary tree
IterableBoolMap has ItemIt type as the other iterable maps
InvertableMap got ValueIterator
alpar [Mon, 30 Jan 2006 09:37:41 +0000] rev 1930
Solve bug #23: Floating versus Integer Coordinates
- BoundingBox values rounds to integer
- The generated .eps rescales if the bounding box were too small otherwise.
alpar [Mon, 30 Jan 2006 09:32:52 +0000] rev 1929
Better doc.
alpar [Mon, 30 Jan 2006 09:32:26 +0000] rev 1928
Use [] instead of set().
alpar [Mon, 30 Jan 2006 09:31:15 +0000] rev 1927
Functions added to set the edges/corners of the bounding box directly.
ladanyi [Sun, 29 Jan 2006 23:46:05 +0000] rev 1926
Do not rely on the autodetection of cplex and glpk.
ladanyi [Sun, 29 Jan 2006 23:32:46 +0000] rev 1925
Updated rpm specfile to include the gui too. Couldn't test it.
ladanyi [Sun, 29 Jan 2006 22:50:55 +0000] rev 1924
ignore radix_sort-bench
ladanyi [Sun, 29 Jan 2006 22:41:55 +0000] rev 1923
distribute simann.h too
ladanyi [Sun, 29 Jan 2006 22:21:37 +0000] rev 1922
Undir -> U transition
ladanyi [Sun, 29 Jan 2006 22:10:06 +0000] rev 1921
test for simann
ladanyi [Sun, 29 Jan 2006 22:07:52 +0000] rev 1920
added simann_maxcut_demo
ladanyi [Sun, 29 Jan 2006 22:06:45 +0000] rev 1919
demo for simann
ladanyi [Sun, 29 Jan 2006 22:06:10 +0000] rev 1918
more doc
ladanyi [Sun, 29 Jan 2006 22:04:48 +0000] rev 1917
include the gui in the deb
deba [Fri, 27 Jan 2006 14:32:33 +0000] rev 1916
make public the shiftedStart inorder to compute just n dijkstra
deba [Fri, 27 Jan 2006 14:18:11 +0000] rev 1915
Add new ItemSetTraits for ANode and BNode
deba [Fri, 27 Jan 2006 08:19:42 +0000] rev 1914
Doc bug fix
deba [Fri, 27 Jan 2006 08:18:47 +0000] rev 1913
Making iterable bool map dynamic
Changed interface
deba [Fri, 27 Jan 2006 08:17:25 +0000] rev 1912
Algorithms by szakall
deba [Thu, 26 Jan 2006 17:18:12 +0000] rev 1911
The pre BpUGraph concept
deba [Thu, 26 Jan 2006 16:24:40 +0000] rev 1910
Bipartite => Bp
Upper => A
Lower => B
+ some bug fix
klao [Thu, 26 Jan 2006 15:42:13 +0000] rev 1909
Undir -> U transition
alpar [Thu, 26 Jan 2006 06:44:22 +0000] rev 1908
Better doc.
alpar [Thu, 26 Jan 2006 06:43:59 +0000] rev 1907
MALE and FEMALE node shape added.
deba [Wed, 25 Jan 2006 16:44:19 +0000] rev 1906
Omitting warnings
ladanyi [Wed, 25 Jan 2006 15:03:45 +0000] rev 1905
Do not append -Wall -W to CXXFLAGS when it is set on the commandline.
deba [Wed, 25 Jan 2006 14:58:04 +0000] rev 1904
Bug fix for empty intervall sorting
deba [Wed, 25 Jan 2006 14:40:26 +0000] rev 1903
Bug fix
deba [Wed, 25 Jan 2006 12:10:18 +0000] rev 1902
state setting function for heaps
If we know that which elements were in the heap then
we can clear it in better time complexity.
deba [Tue, 24 Jan 2006 16:07:38 +0000] rev 1901
Lemon Graph Format uses label instead of id named map.
alpar [Thu, 19 Jan 2006 16:56:39 +0000] rev 1900
Fix bug #18: bug in LpSolverBase::Col operator!= and ::Row operator!=
alpar [Wed, 18 Jan 2006 09:42:59 +0000] rev 1899
- setCol() -> col()
- better doc.
alpar [Wed, 18 Jan 2006 09:42:08 +0000] rev 1898
- tolerance() added.
- better doc.
alpar [Wed, 18 Jan 2006 09:40:53 +0000] rev 1897
Tolerance<long double> added
hegyi [Sat, 14 Jan 2006 13:42:37 +0000] rev 1896
Documentation of classes realizing algorithm running.
alpar [Sat, 14 Jan 2006 08:44:59 +0000] rev 1895
- colName() added (untested on CPLEX)
- possibility to set lower/upper bounds of several cols at once
- setObj() -> obj()
- setRow() -> row()
alpar [Sat, 14 Jan 2006 08:17:00 +0000] rev 1894
Changes in doc
hegyi [Thu, 12 Jan 2006 15:24:24 +0000] rev 1893
Documenatation of MapWin.
hegyi [Thu, 12 Jan 2006 14:36:08 +0000] rev 1892
Documentation of MapSelector. If no default value is present in MapSelector, Reset button does not appear.
hegyi [Thu, 12 Jan 2006 13:28:54 +0000] rev 1891
Documentation of NoteBookTab. Redundant function parameters are removed from other classes as well.
hegyi [Wed, 11 Jan 2006 15:49:06 +0000] rev 1890
Documentation of NewMapWin.
hegyi [Wed, 11 Jan 2006 15:06:17 +0000] rev 1889
Documentation of MainWin.
hegyi [Tue, 10 Jan 2006 15:15:57 +0000] rev 1888
If default value of a new map is constant, the newly created elements will get that value as well. Documentation is added to BrokenEdge, MapStorage and GraphDisplazCanvas classes.
hegyi [Mon, 09 Jan 2006 12:41:06 +0000] rev 1887
The tree that is created for evaluation of expression string at new map creation is deleted after usage.
hegyi [Mon, 09 Jan 2006 11:55:47 +0000] rev 1886
Creation of algorithm dialog is even simpler by the usage of the newly created addMapSelector function.
hegyi [Fri, 06 Jan 2006 23:16:51 +0000] rev 1885
Forgotten file committed.
hegyi [Fri, 06 Jan 2006 16:07:08 +0000] rev 1884
In algorithm window maps can be selected and reated through MapSelector widget.
ladanyi [Fri, 06 Jan 2006 14:44:04 +0000] rev 1883
Set arrow coordinates when creating a new edge.
hegyi [Fri, 06 Jan 2006 14:36:46 +0000] rev 1882
MapSelector has become a standalone class.
hegyi [Fri, 06 Jan 2006 13:58:49 +0000] rev 1881
Result of KruskalGUIAlgo is refreshed if displayed, but no more setin a forced way.
alpar [Fri, 06 Jan 2006 10:42:58 +0000] rev 1880
Reformatting: too long code lines.
hegyi [Thu, 05 Jan 2006 16:54:34 +0000] rev 1879
Kruskal algorithm can be run from GUI from now on.
hegyi [Thu, 05 Jan 2006 12:30:09 +0000] rev 1878
Several changes. \n If new map is added to mapstorage it emits signal with the name of the new map. This was important, because from now on not only tha mapwin should be updated. \n Furthermore algobox gets a pointer to mapstorage instead of only the mapnames from it. This is important because without it it would be complicated to pass all of the required maps to algobox.
ladanyi [Thu, 05 Jan 2006 01:54:24 +0000] rev 1877
Set the move tool active by default.
hegyi [Wed, 04 Jan 2006 18:05:55 +0000] rev 1876
Communication with algorithm window is developed.