+++++++++++++++++++++++++
           H E L P
+++++++++++++++++++++++++
N E W   D I R E C T E D 
      G R A P H
+++++++++++++++++++++++++
To create a NEW DIRECTED GRAPH,
click New Graph->New Directed Graph.
The old graph will be discarded
+++++++++++++++++++++++++
N E W   U N D I R E C T E D 
      G R A P H
+++++++++++++++++++++++++
To create a NEW UNDIRECTED GRAPH,
click New Graph->New Undirected Graph.
The old graph will be discarded
+++++++++++++++++++++++++
    N E W    N O D E 
+++++++++++++++++++++++++
To create a NEW NODE double click
inside the Application's blank area.
In the top left corner of the
node you will see the node's
supply.The MAXIMUM NUMBER OF
NODES is 15
+++++++++++++++++++++++++
 D E L E T E    N O D E 
+++++++++++++++++++++++++
To delete a NODE double-click
with right mouse button or
hold down the Control key and
double-click inside a node.
All arcs that are incident
to that node shall be deleted.
+++++++++++++++++++++++++
    N E W    A R C
+++++++++++++++++++++++++
In order to create a NEW ARC 
start dragging from inside a node
and release mouse 
inside another node.The MAXIMUM
NUMBER OF ARCS is 28  
+++++++++++++++++++++++++
  D E L E T E  A R C
+++++++++++++++++++++++++
In order to delete an ARC 
start right dragging or
press ctrl key and left dragging,
from inside a node and release
mouse inside another node.
+++++++++++++++++++++++++
V I E W   A N D   D R A W
     G R A P H 
+++++++++++++++++++++++++
Click on menu choice
View and Draw Graph to view 
and draw an existing
Graph
+++++++++++++++++++++++++
A D J A C E N C Y   M A T R I X    
+++++++++++++++++++++++++
In order to view the ADJACENCY
MATRIX click on menu choice
Adjacency Matrix
+++++++++++++++++++++++++
N O D E - A R C    M A T R I X    
+++++++++++++++++++++++++
In order to view the NODE-ARC 
MATRIX click on menu choice
Node-Arc Matrix
+++++++++++++++++++++++++
I N P U T   D A T A 
+++++++++++++++++++++++++
Click on menu choice
Input Data->Input Data for 
Graph to enter node supplies/demands
and/or arc costs.You won't 
be able to continue drawing
the Graph while you are 
entering node supplies/demands
and/or arc Costs
+++++++++++++++++++++++++
S O L V E  A  P R O B L E M 
+++++++++++++++++++++++++
Click on menu choice
Solve a Problem to see a 
running static visualization of
an Algorithm.
You may choose among 
Depth  First Search (DFS),
Bredth First Search (BFS),
Topological Sorting,
DAG Shortest Paths,
Dijkstra, Bellman-Ford,
Prim, Kruskal
and Network Simplex Algorithm.
Choose Network Simplex Animation
to see a dynamic visualization
-animation.
+++++++++++++++++++++++++++
E X E C U T I O N    O P T I O N S 
+++++++++++++++++++++++++++
The user can execute an algorithm 
either by non-stop animation providing
optionally a time delay in milliseconds
or   step by step. Whichever case is selected,
all the necessary textual information that
accompanies the algorithm execution 
is depicted inside the blue vertical strip.
+++++++++++++++++++++++++
      E X I T 
+++++++++++++++++++++++++
Click on menu choice
Exit-> Exit Application 
to close the application.
+++++++++++++++++++++++++
A P P L E T  P A R A M E T E R S
+++++++++++++++++++++++++
1)nodeDiameter(nD)
  ----------------
Each Node's Diameter in Pixels
(Initially set to 40 pixels)

2)nodeToNodeDistance(nTND)
  ------------------------
Each node's top left x coordinate
(the x parameter of the 
node's g.fillOval(x,y,width,height)),
must satisfy the following inequalities:

x>=x(left)+nodeDiameter+nTND

or

x<=x(right)-nTND

where left and right are nodes that
lie left or right of the current node.

Each node's top left y coordinate
(the y parameter of the 
node's g.fillOval(x,y,width,height)),
must satisfy the following inequalities:

y>=y(down)+nodeDiameter+nTND

or

y<=y(up)-nTND

where up and down are nodes that
lie above or below of the current node.
 
(Initially nodeToNodeDistance is
 set to 50 pixels)

3)nodeDistanceFromCanvasBorder(nDFCB)
  -----------------------------------
Each node's top left x coordinate
(the x parameter of the 
node's g.fillOval(x,y,width,height)),
must satisfy the following inequalities:

x>=nDFCB (leftmost node)

or

x<=canvasWidth-nDFCB-nodeDiameter
(rightmost node)

Each node's top left y coordinate
(the y parameter of the 
node's g.fillOval(x,y,width,height)),
must satisfy the following inequalities:

y>=nDFCB (topmost node)

or

y<=canvasHeight-nDFCB-nodeDiameter
(next to bottom node) 

( Initially set to 20 pixels)
+++++++++++++++++++++++++