View source: R/edit_dist_graph.R
The edit distance from the learned to the true undirected graph Both graphs are stored in adjacency matrix. The outcome is a list consists of tp, fp, tn, fn, precision, recall, F1 score and edit distance.
1 | edit_dist_graph(learned, true, debug = FALSE)
|
learned |
The learned graph stored in an adjacency matrix format. |
true |
The true graph stored in an adjacency matrix format. |
debug |
A boolean argument to show steps of the backtracking algorithm. |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.