Counts: Modelling, Foundations, DAG

Содержание и основные понятия

Back to the table of contents
Alterna chapter 17
Counts: Modelling, Foundations, DAG
Models and graphs are the basis for OGE No. 4.9 and EGE No.1
The graph is the most powerful tool for discrete mathematics. Social media, maps, project assembly, neuronets are all graphs. In this chapter, basics are: vertices, ribs, degrees, a matrix of relatedness. In chapter 21, deep algorithms (Dakestra, A*).
GEF · Grade 9
PIF · Baseline
OGE No. 4.9
EGE No. 1
17
Chapter Pages
Five pages with theory, interactors and a bank of assignments.
17.1
Modelling and information models
What is a model, models (material/information), modelling stages.
17.2
Counts: bases
Tops, ribs, degrees.
Canvas - Graphic Editor
.
17.3
Calculation of the routes to the DAG
DAG, topological sorting, DP method.
Simulator
with step-by-step track dp[v].
17.4
Workshop
Bank 20 jobs: 10 EEG + 10 EGE No. 1 with reviews. Filters, progress indicator.
17.5
Polygon examination
Quest 800 XP + test 10 min + open task with reference.
🔗
Links with other chapters
Chapter 15
Logic: truth tables, operations , ,, B. These operations are the basis for the track analysis in the graphs.
Chapter 16
Schematics: Logical valves, connections between elements. Graphs are a way to present these connections.
Chapter 18
Bulla algebra: De Morgan's laws, absorptions, glues, these laws are the key to simplifying the boulder formulas on the graphs.
Chapter 21
Advanced algorithms: Dakestra, A*, Bellman-Ford, maximum flow.
Chapter 22
Trees: Link Count without Cycles, Spare Trees, Binary Trees of Solutions.
Chapter 23
Networks and flows: maximum flow challenge, transport challenges.
Chapter 24
Games and strategies: state graphs, finding win-win ways in games.