Haydn 1.3

Bug fix: In the previous release, if the user moved a node, the "dirty bit" in text panel for the graph would not be set and the user would not be warned to save the change before closing. This has been fixed.

Haydn 1.2

• status bar now shows edit state to make it easier for user to track undo/redo operations
• bug fix: addition and deletion of nodes/edges in context of undo/redo now works correctly
• bug fix: edit state now restored correctly when animation terminates
• toggling directed/undirected property of graph in graph window has no effect on text representation of graph: this allows user to easily run, e.g., shortest paths algorithms, both ways without altering graph; directedness can still be modified using the text editor

Haydn 1.1

Fixed a few bugs introduced in recent versions.

• layered graph algorithms now work again (edge id's were reintroduced)
• setDirected() invoked during an algorithm now works as advertised for getOutgoingEdges() and getIncomingEdges() of a node

Haydn 1.0

The main new feature is the ability to undo and redo changes while editing using ctrl-z and ctrl-y. respectively.
This functionality is restricted to creation, deletion, and editing of weights and labels.
It is not possible to undo changes in node positions.

Haydn (0.2 - a few additional features)

Release notes:

User

• dijkstra is now interactive and uses positions to calculate edge weights if they don't exist

Animator

• display and print now take multiple arguments, each can be an arbitrary object

Research (layered graphs)

• drawing of layered graphs more sophisticated (allows non-contiguous positions)

Haydn (0.1 - minor revision)

1. Fixed a bug related to marking graphs as dirty:

• before the fix, graphs were marked always marked as having been changed
• now they are marked changed only if edited by the user

2. Enhanced dfs_scc (strongly connected components) and euclidean (version of Dijkstra's algorithm) to be interactive

Haydn

Lots of new features and more robust (and informative) exception handling. Key additions are

• selected edges during editing are dashed instead of highlighted (so you can see color changes)
• selected nodes are shaded cyan to make them more visible
• a set data structure with all the expected operations, and functions that return nodes and edges as sets
• more sophisticated priority queues, allowing comparators based on attributes other than weight
• query functions that allow the animation to interact with the user to get a node, edge, number, string or boolean

CPE-1

Several bugs corrected and features added. The primary new features are the addition of functions
String getString(prompt)
Integer getInteger(prompt)
Double getDouble(prompt)
which allow an algorithm to prompt the user for text or numbers.

CPE

This is the first public release. Details are reported in
North Carolina State University Technical Report TR-2016-8
at ftp://ftp.ncsu.edu/pub/unity/lockers/ftp/csc_anon/tech/2016/TR-2016-8.pdf