# Learning Paths in a Knowledge Structure

### Description

Computes learning paths in a knowledge structure.

### Usage

1 | ```
lpath(x)
``` |

### Arguments

`x` |
An |

### Details

A learning path in a knowledge structure is a maximal sequence of
knowledge states, which allows learners to gradually traverse a
knowledge structure from the empty set *{}* (or any other
bottom state) to the full set of domain problems *Q*.

`lpath`

takes an arbitrary knowledge structure and computes all
possible learning paths in the respective knowledge structure.

### Value

A list where each element represents one learing path.

### References

Doignon, J.-P., Falmagne, J.-C. (1999) *Knowledge Spaces*. Heidelberg:
Springer Verlag.

### See Also

`kstructure`

### Examples

1 2 3 4 | ```
kst <- kstructure(set(set(), set("a"), set("b"), set("a","b"),
set("a","d"), set("b","c"), set("a","b","c"), set("a","b","d"),
set("b","c","d"), set("a","b","c","d"), set("a","b","c","d","e")))
lpath(kst)
``` |