Description Usage Arguments Details Value Examples
Get all important data for plotting a Cognitive Map in ggplot
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 |
project |
A QDA project, a list as generated by the ProjectCMap function. |
min.weight |
A integer that will determine the minimum (>=) weight of relationships that will be taken into account. Relationships with a lower weight (<) will not be shown. Default is set to 1 (i.e. all relationships are shown). |
filters |
A list of named strings that will filter the relationships showed in the SCM. e.g. =list(coding_class = "A_coding_class", document_part = "A_document_part")=. To date, these filters are linked to the nature of relationships. |
units |
A string vector giving the names of the units (i.e. classes linked to documents) that will be include in the SCM. It is a second type of filter. |
weighted.icm |
A boolean. If FALSE, the weight of the relationships in the ICM will be fixed to 1. |
label |
A character string that defines the text that will be print in the variables (vertex) of the cognitive maps. It can be "num", "name" or "numname" (which is of the form "NUM - Name"). The default is "num" |
minlen |
A graphical parameter that defines a relative lenght between the variable of the cognitive maps. See help from RGraphViz package. |
fontsize |
The fontsize of vertices (concepts), in r-base plot |
shape |
The shape of the verices (concepts), in r-base plot |
layoutType |
Type of graph. See detail in RGraphViz. Can be 'neato', 'dot', 'twopi', 'circo', and 'fdp'. The default is 'neato'. |
vertex.filter |
A vector of integers or characters given the 'id' of vertices (concepts) that will be included in the map. By default, all vertices are included (vertex.filter = NULL) |
edge.filter |
A vector of characters given the name "i~j" of edges (relationships from "i" to "j") that will be included in the map. By default, all edges are included (edge.filter = NULL) |
limit.to.filters |
A logical that will impact the position of the vertices. FALSE (the default) will filter vertices and edges (vertex.filter, edge.filter) keeping the position they would have in the unfiltered cognitive map (interesting with background). TRUE will fully re-compute the position of the vertices, building a cognitive map in its own (better readability). |
level |
0 or 1. Filter the edge/vertices at x level around the filtered edges/vertices (==Not implemented yet==) |
Get all important data for plotting a Cognitive Map in ggplot
A list of two data frames : -edges -vertex. In each of these data frames, the main columns are linked to the coordinates of vertex (x, y, x.from, y.from, x.to, y.to)
1 2 3 4 5 6 7 8 | project_name <- "a_new_project"
main_path <- paste0(system.file("testdata", package = "cogmapr"), '/')
my.project <- ProjectCMap(main_path, project_name)
data.ggCMap(my.project)
data.ggCMap(my.project, min.weight = 3)
data.ggCMap(my.project, edge.filter = "4")
data.ggCMap(my.project, units = "Belgium")
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.