Download Latest Version alephw-1.9a.tbz (644.7 kB)
Home / v7.3.3
Name Modified Size InfoDownloads / Week
Parent folder
aleph-w-7.3.3-Linux.deb 2026-11-02 2.6 MB
aleph-w-7.3.3-Linux.rpm 2026-11-02 2.6 MB
aleph-w-7.3.3-Source.tar.gz 2026-11-02 6.7 MB
README.md 2026-11-02 3.2 kB
v7.3.3 source code.tar.gz 2026-11-02 6.7 MB
v7.3.3 source code.zip 2026-11-02 8.2 MB
Totals: 6 Items   26.8 MB 0

7.3.3 (2026-11-02)

Bug Fixes

  • Address the 7.3.2 review and test the graphs exhaustively (#155) (951e9a0)
  • errors: Take the condition of the throwing macros as an if does, and make them a while again (#155) (951e9a0)
  • graph: Let what the arc filters throw reach the caller of every algorithm (#155) (951e9a0)
  • graph: Make the shortest paths, Johnson and the k shortest paths work near the limits of the type (#155) (951e9a0)
  • graph: Give the arcs into a node of a digraph, with In_Arcs_Index and the forms that take the graph (#155) (951e9a0)
  • graph: Take the filter object where only its type could be given (#155) (951e9a0)
  • graph: Make the walks of Eppstein go on from the target (#155) (951e9a0)
  • flow: Give the maximum flow with floating capacities, and with an arc from the source to the sink (#155) (951e9a0)
  • matching: Make the Hungarian assignment right near the limits, and the bipartite matching maximum on graphs that are not directed (#155) (951e9a0)
  • list: Keep the items of the sorts of lists and of DynDlist when a comparison or a move throws (#155) (951e9a0)
  • heap: Keep the Fibonacci heaps whole when the move of their comparison throws (#155) (951e9a0)
  • test: Test the graph algorithms exhaustively, and their filters by a contract matrix (#155) (951e9a0)
  • graph: Make latex_floyd.H take the lightest of the parallel arcs (#153) (5b4d233)
Source: README.md, updated 2026-11-02