|
Simplex
Twophase
Dijkstra
Prim
Kruskal
Ford-Fulkerson
FAQ
|
Would you send me the JAVA source files of the applets?
- Please take them by yourself from the following links.
- These files can also be obtained from the pages listed on the left margin.
Would you send me the data files of the graphs for the applets?
- For example, a data file for
demo 1 of Dijkstra's algorithm
is g1.obj,
the name of which will be found at the applet tag in
demo 1 as
< applet code="Dijkstra.class" width=400 height=300>
< param name=inputfile value="../graphs/g1.obj"> < /applet>
- The names of the other data files can be retrieved in a similar way.
Would you tell me the format of the data file?
- The first line declares that the graph is an (n, m) graph/digraph,
where n is a number of vertices and m is a number of edges.
Each of the next n lines declares the name of each vertex and
its (x,y) coordinates.
Each of the last m lines declares the name of each edge,
its initial and terminal vertices, and its length/cost/capacity.
See, for example, g1.obj.
- The name of an edge might be a null string,
while the name of a vertex can not be omitted.
The name without an alphabet (only numbers) must be quoted.
There is a method called rdb() in Maxflow.java, Dijkstra.java,
and Prim.java. What does it stand for?
- It stands for Relational Data Base.
- Let f be a map from X to Y. It is often convenient to have
an inverse relation f-1: Y -> 2X,
which is called relational data base or inverted file.
- For each v in V,
rdb() makes a set of edges e in E such that the initial/terminal vertex of e
is v.
Do you have a source code written in C, C++, or Visual Basic?
Can you tell me why I can't compile your JAVA source code?
- No, I can't. However, you might misspell the file name,
which must be consistent with the class name declared in the source file
up to the upper/lower cases.
Will you help me?
Will you debug my program?
Will you advise me about my assignment?
- No, I won't. I'm busy to debug my life.
|