Research of Planning Algorithms
The program was designed for students. Almost all options are implemented to protect the coursework + a very convenient and easily modified GUI on the subject "Computer Systems Software" KPI FIVT, VT department.
The program consists of two editors of the Graph of Task and the Graph of System.
All cyclical inspections are carried out.
For the graph of the system, a connection check is carried out
Graphs can be stored in a file.
All planning algorithms and all immersion algorithms are implemented to the system topology set by the graph
A random graffiti generator (you can set the connection, the ratio. The heights of the heights and the heights, generation by max. and min. Weight of connections and heights, call. the top)
Start the immersion modeling for a given number of graphs with different parameters and draw the results into the tables for each planning and immersion algorithm separately.
The program consists of two editors of the Graph of Task and the Graph of System.
All cyclical inspections are carried out.
For the graph of the system, a connection check is carried out
Graphs can be stored in a file.
All planning algorithms and all immersion algorithms are implemented to the system topology set by the graph
A random graffiti generator (you can set the connection, the ratio. The heights of the heights and the heights, generation by max. and min. Weight of connections and heights, call. the top)
Start the immersion modeling for a given number of graphs with different parameters and draw the results into the tables for each planning and immersion algorithm separately.
Kyiv 
Very busy