|
||||||||
OverviewMaybe this small Application should rather be christened "To do
helper", or "To do sorter"! In fact, it is perfectly adequate
for this purpose. Just start to write down line by line all what you must
do. In a second step you go through your list defining which items must be
done before an other one. You do this by copy/paste an item onto the same
line as the related one. Either in front or after it. Separate the items
with one of the separators either Beside, with regard to circular dependencies, just use this app to detect them! Technical BackgroundIn graph theory, a topological sort or topological ordering of a directed acyclic graph (DAG) is a linear ordering of its nodes in which each node comes before all nodes to which it has outbound edges. Every DAG has one or more topological sorts. WebstartFor your convenience try the Webstart Example.
Local launchLaunching local allows access to the file system and enables the file open, save and print functions. Try it! Download jar for local execution Usage to launch the application on the local computer: java -jar WhatFirst-20110131.jar [language code] [encoding of in/out files]Example detail:
Actually implemented languages are: en, de, fr and es. Id est: English, German, French and Spanish. HintCreate a new link to launch the java application with a simple click, see example:
|
||||||||