1. Definition of the subject of interest System analysis.
2. Basic concepts of graph theory I.
3. Basic concepts of graph theory II.
4. Problem on common interface, regularity of connections in a system.
5. Problem on paths in a system.
6. Predecessors and successors, paths between two elements of a system.
7. The role of feedback and cycle in a system.
8. Problems on minimum distance. Problem on minimum graph framework.
9. Hamiltonian and Eulerian paths in graphs.
10. Petri nets - structure and dynamic behavior of a system.
11. Application of graph theory in project management, CPM.
12. PERT (Program Evaluation and Review Technique).
13. Topological decomposition of a system - Vlček's minimum cut algorithm.
2. Basic concepts of graph theory I.
3. Basic concepts of graph theory II.
4. Problem on common interface, regularity of connections in a system.
5. Problem on paths in a system.
6. Predecessors and successors, paths between two elements of a system.
7. The role of feedback and cycle in a system.
8. Problems on minimum distance. Problem on minimum graph framework.
9. Hamiltonian and Eulerian paths in graphs.
10. Petri nets - structure and dynamic behavior of a system.
11. Application of graph theory in project management, CPM.
12. PERT (Program Evaluation and Review Technique).
13. Topological decomposition of a system - Vlček's minimum cut algorithm.