{ "_id": "6a105cacacfb0bcc41ca4460", "Package": "CurricularComplexity", "Type": "Package", "Title": "Toolkit for Analyzing Curricular Complexity", "Version": "1.0.1", "Authors@R": "c(person(given = \"David\", family = \"Reeping\", role = c(\"aut\",\"cre\"), email = \"reepindp@ucmail.uc.edu\"))", "Author": "David Reeping [aut, cre]", "Maintainer": "David Reeping ", "Description": "Enables educational researchers and practitioners to\ncalculate the curricular complexity of a plan of study,\nvisualize its prerequisite structure at scale, and conduct\ncustomizable analyses. The original tool can be found at\n. Additional functions to\nexplore curriculum complexity from the literature are also\nincluded.", "Encoding": "UTF-8", "License": "MIT + file LICENSE", "VignetteBuilder": "knitr", "RoxygenNote": "7.3.3", "NeedsCompilation": "no", "Packaged": { "Date": "2026-05-09 05:00:21 UTC", "User": "root" }, "Repository": "https://cran.r-universe.dev", "Date/Publication": "2026-01-09 02:29:43 UTC", "RemoteUrl": "https://github.com/cran/CurricularComplexity", "RemoteRef": "HEAD", "RemoteSha": "e5eec561efaf2ef4f3e517d9cb60cc4b8ccec40e", "MD5sum": "ada172e42a4554da7cfc75a47db786f7", "_user": "cran", "_type": "src", "_file": "CurricularComplexity_1.0.1.tar.gz", "_fileid": "b01252726c8fbfd115fde10fd83393cb3434aa2970b0d8e54040c164be837a18", "_filesize": 364683, "_sha256": "b01252726c8fbfd115fde10fd83393cb3434aa2970b0d8e54040c164be837a18", "_created": "2026-05-09T05:00:21.000Z", "_published": "2026-05-22T13:39:56.664Z", "_distro": "noble", "_jobs": [ { "job": 77391193227, "time": 118, "config": "linux-devel-x86_64", "r": "4.7.0", "check": "OK", "artifact": "6893021060" }, { "job": 77391193070, "time": 110, "config": "linux-release-x86_64", "r": "4.6.0", "check": "OK", "artifact": "6893019685" }, { "job": 77391193291, "time": 177, "config": "source", "r": "4.6.0", "check": "OK", "artifact": "6893007662" }, { "job": 77391192779, "time": 116, "config": "wasm-release", "r": "4.6.0", "check": "OK", "artifact": "7161903575" } ], "_buildurl": "https://github.com/r-universe/cran/actions/runs/25592273970", "_status": "success", "_host": "GitHub-Actions", "_upstream": "https://github.com/cran/CurricularComplexity", "_commit": { "id": "e5eec561efaf2ef4f3e517d9cb60cc4b8ccec40e", "author": "David Reeping ", "committer": "cran-robot ", "message": "version 1.0.1\n", "time": 1767925783 }, "_maintainer": { "name": "David Reeping", "email": "reepindp@ucmail.uc.edu" }, "_registered": true, "_dependencies": [ { "package": "R", "version": ">= 3.6.2", "role": "Depends" }, { "package": "igraph", "version": ">= 1.2.5", "role": "Depends" }, { "package": "knitr", "role": "Suggests" }, { "package": "rmarkdown", "role": "Suggests" } ], "_owner": "cran", "_selfowned": false, "_usedby": 0, "_updates": [ { "week": "2025-45", "n": 1 }, { "week": "2026-02", "n": 1 } ], "_tags": [ { "name": "1.0", "date": "2025-11-04" }, { "name": "1.0.1", "date": "2026-01-09" } ], "_stars": 0, "_userbio": { "uuid": 6899542, "type": "organization", "name": "cran", "description": "Unofficial read-only mirror of all CRAN R packages" }, "_downloads": { "count": 482, "source": "https://cranlogs.r-pkg.org/downloads/total/last-month/CurricularComplexity" }, "_searchresults": 0, "_rbuild": "4.6.0", "_assets": [ "extra/citation.cff", "extra/citation.html", "extra/citation.json", "extra/citation.txt", "extra/contents.json", "extra/CurricularComplexity.html", "extra/NEWS.html", "extra/NEWS.txt", "manual.pdf" ], "_realowner": "cran", "_cranurl": false, "_releases": [ { "version": "1.0", "date": "2025-11-04" }, { "version": "1.0.1", "date": "2026-01-09" } ], "_exports": [ "admissibility_test", "average_sequencing", "blocking_factor", "core_collapse", "create_plan_of_study", "cruciality", "curriculum_rigidity", "deferment_factor", "delay_factor", "explained_complexity", "find_bottlenecks", "find_inbound_courses", "find_outbound_courses", "inflexibility_factor", "plot_plan_of_study", "reachability_factor", "simplify_requisites", "structural_complexity", "student_mobility_turbulence", "subcomplexity_graph", "transfer_delay_factor", "transfer_excess_courses" ], "_help": [ { "page": "admissibility_test", "title": "Automatically check for data entry issues", "topics": [ "admissibility_test" ] }, { "page": "average_sequencing", "title": "Calculates the average sequencing in a program", "topics": [ "average_sequencing" ] }, { "page": "blocking_factor", "title": "Calculates the blocking factor of a course", "topics": [ "blocking_factor" ] }, { "page": "core_collapse", "title": "Calculates the core collapse sequence for a plan of study", "topics": [ "core_collapse" ] }, { "page": "create_plan_of_study", "title": "Create a plan of study igraph object", "topics": [ "create_plan_of_study" ] }, { "page": "cruciality", "title": "Calculates the cruciality of a course", "topics": [ "cruciality" ] }, { "page": "curriculum_rigidity", "title": "Calculates the curriculum rigidity", "topics": [ "curriculum_rigidity" ] }, { "page": "deferment_factor", "title": "Calculates the deferment factor of a course", "topics": [ "deferment_factor" ] }, { "page": "delay_factor", "title": "Calculates the delay factor of a course", "topics": [ "delay_factor" ] }, { "page": "explained_complexity", "title": "Calculates the explained complexity of courses extending time to degree", "topics": [ "explained_complexity" ] }, { "page": "find_bottlenecks", "title": "Finds the bottlenecks in the plan of study based on prerequisite relationships", "topics": [ "find_bottlenecks" ] }, { "page": "find_inbound_courses", "title": "Find all possible prerequisites to a course", "topics": [ "find_inbound_courses" ] }, { "page": "find_outbound_courses", "title": "Find all possible courses that depend on a particular course", "topics": [ "find_outbound_courses" ] }, { "page": "inflexibility_factor", "title": "Calculates inflexibility factor of a plan of study", "topics": [ "inflexibility_factor" ] }, { "page": "plot_plan_of_study", "title": "Plots the plan of study with courses ordered by term", "topics": [ "plot_plan_of_study" ] }, { "page": "reachability_factor", "title": "Calculates the reachability factor of a course", "topics": [ "reachability_factor" ] }, { "page": "simplify_requisites", "title": "Convert requisites to original notation", "topics": [ "simplify_requisites" ] }, { "page": "structural_complexity", "title": "Calculates structural complexity of a plan of study", "topics": [ "structural_complexity" ] }, { "page": "student_mobility_turbulence", "title": "Calculates the student mobility turbulence for a program", "topics": [ "student_mobility_turbulence" ] }, { "page": "subcomplexity_graph", "title": "Creates a subcomplexity graph for a course", "topics": [ "subcomplexity_graph" ] }, { "page": "transfer_delay_factor", "title": "Calculates the transfer delay factor of a course", "topics": [ "transfer_delay_factor" ] }, { "page": "transfer_excess_courses", "title": "Finds the subcomplexity graph of courses beyond expected time to degree", "topics": [ "transfer_excess_courses" ] } ], "_rundeps": [ "cli", "cpp11", "glue", "igraph", "lattice", "lifecycle", "magrittr", "Matrix", "pkgconfig", "rlang", "vctrs" ], "_vignettes": [ { "source": "CurricularComplexity-demo.Rmd", "filename": "CurricularComplexity-demo.html", "title": "CurricularComplexity Demo", "author": "David Reeping", "engine": "knitr::rmarkdown", "headings": [ "1. Data Requirements", "1.1 Representing more complex prerequisite relationships", "1.2 Converting the notation to all ANDs", "1.3 Representing electives", "1.3.1 Electives as generic, standalone courses", "1.3.2 Electives as generic, but connected courses", "1.3.3 Customizing pathways with frequently taken electives", "2. Conducting simple curricular analytics", "2.1 Blocking Factor", "2.2 Delay Factor", "2.3 Cruciality", "2.4 Structural Complexity", "2.4.1 Structural complexity and the quarter system", "3. Digging deeper into a plan of study", "3.1 Extracting course sequences", "3.2 Unbundling layers of requirements", "3.3 Other course-level metrics", "3.3.1 Deferment factor", "3.3.2 Bottleneck courses", "3.3.3 Reachability Factor", "3.4.1 Curriculum rigidity", "4. Transfer-Sensitive Metrics", "4.1 Transfer Delay Factor", "4.2 Explained Complexity", "4.3 Inflexibility Factor" ], "created": "2025-11-04 19:28:58", "modified": "2026-01-09 02:29:43", "commits": 2 } ], "_score": 2.3010299956639813, "_indexed": true, "_nocasepkg": "curricularcomplexity", "_universes": [ "cran" ], "_binaries": [ { "r": "4.7.0", "os": "linux", "version": "1.0.1", "date": "2026-05-09T05:02:29.000Z", "distro": "noble", "commit": "e5eec561efaf2ef4f3e517d9cb60cc4b8ccec40e", "fileid": "834339984a45366521fbd1374877870b19ab188f02f9f6578df6404e4a919ee3", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/cran/actions/runs/25592273970" }, { "r": "4.6.0", "os": "linux", "version": "1.0.1", "date": "2026-05-09T05:02:15.000Z", "distro": "noble", "commit": "e5eec561efaf2ef4f3e517d9cb60cc4b8ccec40e", "fileid": "9ea567a57f80e2632f39364ac4a52d52b1baac99decd562b8eb804eefffc9d11", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/cran/actions/runs/25592273970" }, { "r": "4.6.0", "os": "wasm", "version": "1.0.1", "date": "2026-05-22T13:39:42.000Z", "commit": "e5eec561efaf2ef4f3e517d9cb60cc4b8ccec40e", "fileid": "a24c835df3f9f9787896f17d605c5832f02ea737d74b93cc9e007017f80fdbd6", "status": "success", "buildurl": "https://github.com/r-universe/cran/actions/runs/25592273970" } ] }