Spellcheck

- svn lock doesn't work
- fix bootstrap switch

Last struggle against Doxygen.

Unified copyright notices

Change the compilation flag at release make distcheck.
(This setting is probably indifferent, though.)

Minor change.

Polish the doc.

graph_adaptor.h: spacing corrections in doc

graph_adaptor.h: probably a doxygen bug: in tex formulas there should be
whitespace after the opening and before the closing \f$

lp_cplex.cc: bugfix in _setColName, _getColName implemented

Fight with Doxygen.
Victory hasn't been reached yet, but it's on the horizon.

Hopefully we can release 0.5 today

minor changes

- workaround for a Doxygen 1.4.6 bug
- other doc fixes

NEWS: major changes since 0.4 added

Use short icpc paths

Fix crash when an arrow is clicked with the delete tool.

kruskal.h: an overloaded function for older, pointer-style iterators

The version tag of the trunk is svn-head

- also works off-line
- icc-8.0 in (not) tested, as well.

Towards icc-8.0 compatibility...

Fix g++-3.4 executable's name

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!

Fix icc compilation failures.

Spellcheck

Bug fix

ANodeIt/BNodeIt should not be inherited from ANode/BNode

The reason:
assert(graph.id(ANodeIt(graph)) == graph.id((Node)ANodeIt(graph)));

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>

Bug fix
friend does not declares type

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

Solve bug #23: Floating versus Integer Coordinates

- BoundingBox values rounds to integer
- The generated .eps rescales if the bounding box were too small otherwise.

Better doc.

Use [] instead of set().

Functions added to set the edges/corners of the bounding box directly.

Do not rely on the autodetection of cplex and glpk.

Updated rpm specfile to include the gui too. Couldn't test it.

ignore radix_sort-bench

distribute simann.h too

Undir -> U transition

test for simann

added simann_maxcut_demo

demo for simann

more doc

include the gui in the deb

make public the shiftedStart inorder to compute just n dijkstra

Add new ItemSetTraits for ANode and BNode

Doc bug fix

Making iterable bool map dynamic
Changed interface

Algorithms by szakall

The pre BpUGraph concept

Bipartite => Bp
Upper => A
Lower => B

+ some bug fix

Undir -> U transition

Better doc.

MALE and FEMALE node shape added.

Omitting warnings

Do not append -Wall -W to CXXFLAGS when it is set on the commandline.

Bug fix for empty intervall sorting

Bug fix

state setting function for heaps

If we know that which elements were in the heap then
we can clear it in better time complexity.

Lemon Graph Format uses label instead of id named map.

Fix bug #18: bug in LpSolverBase::Col operator!= and ::Row operator!=

- setCol() -> col()
- better doc.

- tolerance() added.
- better doc.

Tolerance<long double> added

Documentation of classes realizing algorithm running.

- colName() added (untested on CPLEX)
- possibility to set lower/upper bounds of several cols at once
- setObj() -> obj()
- setRow() -> row()

Changes in doc

Documenatation of MapWin.

Documentation of MapSelector. If no default value is present in MapSelector, Reset button does not appear.

Documentation of NoteBookTab. Redundant function parameters are removed from other classes as well.

Documentation of NewMapWin.

Documentation of MainWin.

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.

The tree that is created for evaluation of expression string at new map creation is deleted after usage.

Creation of algorithm dialog is even simpler by the usage of the newly created addMapSelector function.

Forgotten file committed.

In algorithm window maps can be selected and reated through MapSelector widget.

Set arrow coordinates when creating a new edge.

MapSelector has become a standalone class.

Result of KruskalGUIAlgo is refreshed if displayed, but no more setin a forced way.

Reformatting: too long code lines.

Kruskal algorithm can be run from GUI from now on.

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.

Set the move tool active by default.

Communication with algorithm window is developed.

Happy new year to LEMON

Doc updates

IterableBool{Upper/Lower}NodeMaps

Best feature ever\! Name of tabs are different from now on\!

Coding of Algorithms has begun, but code is really-really ugly yet.

Delete misnamed file

Handling of tabs is rationalized a bit. More than one file can be given at startup in command prompt. If there is no file given in command prompt, an empty tab will be present at startup.

Bug fix in bipartite graph

Fix crash when the input file does not contain any nodeset or edgeset.

New file and data structures: sub_graph
Moved to new group with the edge_sets

Doc fix

Fixing Bellman's name

Demos and benchmarks are not built by default now. They can be enabled with the --enable-demo and --enable-benchmark configure flags.

Added guipixbufs.h to BUILT_SOURCES. This solves 'make dist' problems.

Distribute xml.h too.

Save and load the coordinates of the arrows on the edges.

Bug fix
and doc fix

Bug fix in def pred map

belmann_ford:
* run() with length limit
* bugfix in processNextRound()

Notebook tabs can be closed.

Eliminate warnins

Bugfix

Fix template version of Invalid.

Some bug fixes and improvments in the io classes

Doc improvements

Bugfix

Notebook style is provided. Without opportunity to close tabs. :-) But with all other necessary things (I think).

Doc bug fix

- Changed and improved Timer interface
- several new member functions
- reset() -> restart() renaming
- TimeReport: a Timer that prints a report on destruction.
- counter.h: a tool to measure the number of streps of algorithms.
- New documentation module for time measuring and counting.

I have forgot the attributes

Implementation redesign
Throws exception

Changed implementation and bug fix

bugfix

NewEdgeSetAdaptor -> ListEdgeSet
and moved to edge_set.h

bug fix

max flow with lp column generation

Some bug fix

MapWin is created and disposed from now instead of being show and hide.

Structure of GUI is now more clear-cut than before.

Clarify INVALID implementation.

- tolerance.h added
- tolerance handler added to preflow (but not yet used!!).

Doc fix

Radix sort algorithm

Bug fix

No segmentation fault caused by zero long edges.

Document improvments

Correcting alteration notifing

Static maps for bipartite graphs.

Fixing bug in g++-3.3

clean-up

fixed some memory leaks

Erasing old header
Correcting makefile

NewMapWin has become Dialog instead of Window. Therefore it is created dynamically, when there is need for it, instead of keeping one instance in memory. This solution is slower, but more correct than before.

Erasing from the Makefile.am too

Erasing old tests

Undir Bipartite Graph/Full and Smart/ without concept, doc and concept
checking

Reorganizing.

UndirEulerIt added

- Spellcheck (pathes->paths)

- Spellcheck (pathes->paths)
- todos

Bugfix

As initial value of a new map expression with ()+-/* operators can be given. These operators work on numbers, or on maps. If maps are given, then the new value for a given graph element will be calculated using the value from the given maps that belong to that graph element.

Bug fix

split(Edge) member function added.

Several bugfices.

Modified iterators on graph maps
Other iterators for not graph maps

The GRAPH_TYPEDEFS macro is a bug.

wirteable -> writable

Empty graph is (strongly) connected.

The first parameter of runningTimeTest became const.
It is necessary to enable to pass of temporary objects.

Iterable Bool maps can count the number of true and false values.

(UNDIR)GRAPH_TYPEDEFS also defines some basic graph maps

Better doc.

Demo for topology

Images for doc

bipartite by szakall

Warning because unused parameters

lp_cplex: getDual compiles; untested

lp_test.cc:

* bugfix in cplex part: check compiling and running on two different instances

lp_skeleton: _getDual "implemented"

bugfix in undir_graph_extender -> graph_extender transition

String->Double

Documentation fixes

Arrangement of the documentation changed

Modification on the base graph concept
The extended interface does not changed

Bug fix

eps images

Some documentation modifications

bugfix in setCol, getting dual values

Doc bug fix

Assertion with own exception throwing

Bug fix

One more bug fix

Bug fix.

Path length limit for belmann_ford.h

- Timer can be stop()ed and (re)start()ed.
- Obsolete \bug removed

Obsolete bug removed

Some just writeable bool maps.

improved zooming

Images for grid_graph_demo

Added doc to demos.

UnsupportedException on erase with Snapshot

Bugfix

SnapShot -> Snapshot

(Dual)Expr::simplify(double tolerance) added

SnapShot -> Snapshot

Removed todo
Moved to topology module

Removing findEdge

Changed name

Tons of todos have been removed.

Removing todos

Images for topology

pred => predEdge rename

throwing an exception if s=t

Hiding :) todos

concept/graph.h: graphs defined by using components (_*Graph) need no
documentation

Increment and decrement operator for IterableIntMap::Reference

Doc fix

Spellcheck

GRAPH_TYPEDEFS and UNDIRGRAPH_TYPEDEFS macros added to graph_utils.h.

Make constructor explicit
Indentation changed

Documentation modified

Some change on the clear

IterableIntMap

todo: documentation need

Swap col and row map

Connected components, etc...
Based on the dfs visitor interface

Visitor interface for the dfs algorithm.

small svn:ignore fixups

Faster implementation

If the file does not exist LemonReader throws exception

Upgrading tests

Removing old input/output functions

Filename can be given as std::string

Show description of the file

Some modifications on shortest path algoritms:
- heap traits
- checked execution

Bug fix in connectedComponents
Strongly connected components

Computing the number of the connected components and the components themselves.

Euler tour iterator.

Newly created map is realized by the property givening by common sense.

Doxyfile for documenting glemon's architecture.

New version of XML reader/writer.
Now, there are only a single XmlIo class both for reading and writing.

- dijkstraZero() added. (Until we conclude how to handle the related problem.)
- processed() query function added.

MapSelector widget is able to pop up NewMap window. At the moment I hope MapSelector widget is done.

Bugfix

Mapselector widget reached its first release, but there are still work to do on it, I know...

Minor changes and bugfixes

Removing signal/commit Change from alteration notifier

It makes slower the change Target/Source functions
and used only by the In/Out DegMap

Updating tests

Doc and changing heap

Doc bugfix

Using proper return type

Heap not for the dijkstra

It will be used in the minCut algorithm

Really short description of these shortest path algorithms

bugfix (affected x86_64 only)

Named parameter for heap and cross ref
It needs some redesign

Matrixmaps moved to own file

Traits moved to own file
Tag for reference maps
Possibility to handle proper the return type
of the operator[]() const -- value or reference

Extending observer interface
It will be used in the indegmap, outdegmap types

Added clear function to heaps and concept

Sym -> Undir

Doc improvments

Shape keeping movement is implemented, at last. Many thanks to Alpar.

Doc improvments

Little modifications

All pairs shortest path test

Bug solved in named parameters
Simplify my Johnson algorithm

Template Named Parameter bugfix

compile with old gtkmm

Changing makefile

Removing NeedCopy

Removing smart references

findUndirEdge, ConUndirEdgeIt
some modification in the undir graph extenders