Аноним

Граф путей концептов: различия между версиями

Материал из WikiGrapp
нет описания правки
Нет описания правки
Нет описания правки
Строка 1: Строка 1:
'''Граф путей концептов''' ([[Concepts_Path_Graph|Concepts Path Graph (CPF)]])
'''Граф путей концептов''' ([[Concepts_Path_Graph|Concepts Path Graph (CPF)]])


'''Граф путей концептов''' is a [[Бесконтурный орграф]] that represents a set of sequencing rules which determine the sequence of concepts.
'''Граф путей концептов''' is a [[бесконтурный орграф]] that represents a set of sequencing rules which determine the sequence of concepts.


'''Граф путей концептов'''  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.  
'''Граф путей концептов'''  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.  
68

правок