gravatar
alpar (Alpar Juttner)
alpar@cs.elte.hu
Update NEWS file
0 1 0
r1.2.1 1.2
1 file changed with 12 insertions and 0 deletions:
12
↑ Collapse diff ↑
Ignore white space 24 line context
1
2010-10-21 Version 1.2.1 released
2

	
3
        Bugfix release.
4

	
5
        #366: Fix Pred[Matrix]MapPath::empty()
6
        #371: Bug fix in (di)graphCopy()
7
              The target graph is cleared before adding nodes and arcs/edges.
8

	
9
        #364: Add missing UndirectedTags
10
        #368: Fix the usage of std::numeric_limits<>::min() in Network Simplex
11
        #372: Fix a critical bug in preflow
12

	
1 13
2010-03-19 Version 1.2 released
2 14

	
3 15
        This is major feature release
4 16

	
5 17
        * New algorithms
6 18
          * Bellman-Ford algorithm (#51)
7 19
          * Minimum mean cycle algorithms (#179)
8 20
            * Karp, Hartman-Orlin and Howard algorithms
9 21
          * New minimum cost flow algorithms (#180)
10 22
            * Cost Scaling algorithms
11 23
            * Capacity Scaling algorithm
12 24
            * Cycle-Canceling algorithms
0 comments (0 inline)