Concepts Path Graph: различия между версиями

Перейти к навигации Перейти к поиску
нет описания правки
Нет описания правки
Нет описания правки
 
(не показана 1 промежуточная версия этого же участника)
Строка 1: Строка 1:
'''Concepts Path Graph (CPF)''' — граф путей концептов
'''Concepts Path Graph (CPG)''' — [[Граф_путей_концептов|граф путей концептов]]


'''Concepts Path Graph (CPF)''' is a [[Directed_acyclic_graph|directed acyclic graph]] that represents a set of sequencing rules which determine the sequence of concepts.
'''Concepts Path Graph (CPG)''' is a [[Directed_acyclic_graph|directed acyclic graph]] that represents a set of sequencing rules which determine the sequence of concepts.


'''Concepts Path Graph''' represents the structure of the concepts of the Domain Concept Ontology that matches the learning goal in hand. The concepts contained in the '''CPF''' are selected based on the connection between the Learning Goals Hierarchy and the Domain Concept Ontology. The structure of the '''CPF''' is directly inherited by the structure of the Domain Concept Ontology. '''CPF''' is a simple [[Directed_graph|directed graph]], that is, a directed graph having no multiple [[node]]s. This means that each concept is contained only once in the '''CPF'''. Additionally, '''CPF''' is an [[Directed_acyclic_graph|acyclic directed graph]], that is, a directed graph containing no directed [[cycle]]s.  
'''Concepts Path Graph''' represents the structure of the concepts of the Domain Concept Ontology that matches the learning goal in hand. The concepts contained in the '''CPG''' are selected based on the connection between the Learning Goals Hierarchy and the Domain Concept Ontology. The structure of the '''CPG''' is directly inherited by the structure of the Domain Concept Ontology. '''CPG''' is a simple [[Directed_graph|directed graph]], that is, a directed graph having no multiple [[node]]s. This means that each concept is contained only once in the '''CPG'''. Additionally, '''CPG''' is an [[Directed_acyclic_graph|acyclic directed graph]], that is, a directed graph containing no directed [[cycle]]s.  
This means that in every possible concept sequence represented by the '''CPF''', each concept has a unique existence.
This means that in every possible concept sequence represented by the '''CPG''', each concept has a unique existence.


[[File:LPG.JPG]]  
[[File:LPG.JPG]]  
68

правок

Навигация