How to find the next step to go

Viewed 346

Having a dataframe like this:

df <- data.frame(
    n1 = c(1, 1, 1, 0, 0),
    n2 = c(0, 0, 0, 0, 1),
    n3 = c(0, 0, 0, 1, 0),
    n4 = c(0, 0, 0, 0, 0),
    n5 = c(0, 0, 0, 1, 0),
    n6 = c(0, 0, 0, 0, 0),
    n7 = c(0, 0, 0, 0, 0)
)

and a graph like this:

library(igraph)
plot(make_full_graph(7), vertex.name = head(LETTERS))

in which the column names of the dataframe is the names of nodes of the graph.

Using a shortest path option from reinforment learning algorithms how it is possible to make it?

1 Answers

This might not be the answer you are looking for, but you would have more luck asking this at Cross Validated, as your question deals more with method than code.

That being said, I would highly recommend taking a look at this vignette regarding the ReinforcementLearning-package for R.

Related