BUGS AND THE LIKE IN VERSION 2.0.0
This page lists bugs in Combinatorica, Version 2.0.0, that was shipped with
Mathematica 5.0.
If the status of a bug is "fixed" then it means that the bug is fixed in the version
of Combinatorica available at
www.combinatorica.com.
These fixes will then make their way into the next release of Mathematica.
Thanks to users for sending us bug reports. Keep sending them in and we
promise to fix these as soon as we can.
BUGS IN VERSION 2.0.0
- BellmanFord
PROBLEM: Does not compute shortest paths correctly.
STATUS: Fixed.
More details.
- NetworkFlow
PROBLEM: NetworkFlow[g, v, v] hangs. That is, finding a max-flow in
graph g from vertex v to itself causes an infinite loop in
NetworkFlow.
STATUS: Not fixed.
More details.
- ShortestPath
PROBLEM: Does not compute shortest paths correctly. This happens when ShortestPath
calls BellmanFord.
STATUS: Fixed.
More details.
- UnrankPermutation
PROBLEM: Does not work correctly for permutations of multisets.
STATUS: Not fixed.
More details.
ALMOST BUGS IN VERSION 2.0.0
"Almost bugs" is a list of Combinatorica behaviors that are not quite
right, even though we don't think of these as bugs. This would include Combinatorica
functions that are inconsistent with standard textbook definitions,
functions that are missing certain obvious features,
functions that are exceptionally slow despite the existence of efficient algorithms, etc.
- GraphJoin
PROBLEM: Graphics information is not correctly inherited by the graph resulting
from GraphJoin.
STATUS: Not fixed.
More details.
- GraphProduct
PROBLEM: Graphics information is not correctly inherited by the graph resulting
from GraphProduct.
STATUS: Not fixed
More details.
- GraphSum
PROBLEM: In GraphSum[g, h] the edges from h loose their graphics
information and acquire the graphics information of edges from g.
STATUS: Not fixed.
More details.
- SetEdgeWeights
PROBLEM: It is not possible to use SetEdgeWeights to assign distinct edge weights to multiple
edges connecting the same pair of vertices.
STATUS: Not fixed.
More details.