{ "_id": "6a1ab0431d7bb097a09d5648", "Package": "RBGL", "Version": "1.89.0", "Title": "An interface to the BOOST graph library", "Authors@R": "c(\nperson(\"Vince\", \"Carey\", role = \"aut\",\nemail = \"stvjc@channing.harvard.edu\"),\nperson(\"Li\", \"Long\", role = \"aut\",\nemail = \"li.long@isb-sib.ch\"),\nperson(\"R.\", \"Gentleman\", role = \"aut\"),\nperson(\"Emmanuel\", \"Taiwo\", role = \"ctb\",\ncomment = \"Converted RBGL vignette from Sweave to RMarkdown / HTML.\"),\nperson(\"Bioconductor Package Maintainer\", role = \"cre\",\nemail = \"maintainer@bioconductor.org\"))", "Description": "A fairly extensive and comprehensive interface to the\ngraph algorithms contained in the BOOST library.", "License": "Artistic-2.0", "URL": "http://www.bioconductor.org", "LazyLoad": "yes", "biocViews": "GraphAndNetwork, Network", "VignetteBuilder": "knitr", "Repository": "https://bioc.r-universe.dev", "Date/Publication": "2026-04-28 12:30:19 UTC", "RemoteUrl": "https://github.com/bioc/RBGL", "RemoteRef": "HEAD", "RemoteSha": "a71f7ab0c1164bf1614d0dd00b03ff52c46970f7", "NeedsCompilation": "yes", "Packaged": { "Date": "2026-05-30 07:04:07 UTC", "User": "root" }, "Author": "Vince Carey [aut],\nLi Long [aut],\nR. Gentleman [aut],\nEmmanuel Taiwo [ctb] (Converted RBGL vignette from Sweave to RMarkdown\n/ HTML.),\nBioconductor Package Maintainer [cre]", "Maintainer": "Bioconductor Package Maintainer ", "MD5sum": "06b7ea7b1996872d1afb972cb1d5dd6c", "_user": "bioc", "_type": "src", "_file": "RBGL_1.89.0.tar.gz", "_fileid": "3b2a7d27ddbd1705f6f19c8002bf76a704cd2f9c3ff44b48eaffb60fb3c20718", "_filesize": 4125328, "_sha256": "3b2a7d27ddbd1705f6f19c8002bf76a704cd2f9c3ff44b48eaffb60fb3c20718", "_created": "2026-05-30T07:04:07.000Z", "_published": "2026-05-30T09:39:15.853Z", "_jobs": [ { "job": 78632277461, "time": 204, "config": "bioc-checks", "r": "4.6.0", "check": "WARNING", "artifact": "7306333864" }, { "job": 78632277478, "time": 222, "config": "linux-devel-arm64", "r": "4.7.0", "check": "WARNING", "artifact": "7306336010" }, { "job": 78632277474, "time": 239, "config": "linux-devel-x86_64", "r": "4.7.0", "check": "WARNING", "artifact": "7306338222" }, { "job": 78632277476, "time": 222, "config": "linux-release-arm64", "r": "4.6.0", "check": "WARNING", "artifact": "7306336018" }, { "job": 78632277489, "time": 262, "config": "linux-release-x86_64", "r": "4.6.0", "check": "WARNING", "artifact": "7306340968" }, { "job": 78632277466, "time": 154, "config": "macos-oldrel-arm64", "r": "4.5.3", "check": "WARNING", "artifact": "7307192286" }, { "job": 78632277482, "time": 545, "config": "macos-oldrel-x86_64", "r": "4.5.3", "check": "WARNING", "artifact": "7306540044" }, { "job": 78632277473, "time": 133, "config": "macos-release-arm64", "r": "4.6.0", "check": "WARNING", "artifact": "7307192344" }, { "job": 78632277471, "time": 401, "config": "macos-release-x86_64", "r": "4.6.0", "check": "WARNING", "artifact": "7306525172" }, { "job": 78631983361, "time": 299, "config": "source", "r": "4.6.0", "check": "OK", "artifact": "7306310196" }, { "job": 78632277452, "time": 162, "config": "wasm-release", "r": "4.6.0", "check": "OK", "artifact": "7306329500" }, { "job": 78632277488, "time": 243, "config": "windows-devel", "r": "4.7.0", "check": "WARNING", "artifact": "7306338661" }, { "job": 78632277484, "time": 214, "config": "windows-oldrel", "r": "4.5.3", "check": "WARNING", "artifact": "7306335132" }, { "job": 78632277456, "time": 262, "config": "windows-release", "r": "4.6.0", "check": "WARNING", "artifact": "7306341636" } ], "_bioccheck": { "error": 0, "warning": 2, "note": 14 }, "_buildurl": "https://github.com/r-universe/bioc/actions/runs/26677508932", "_status": "success", "_host": "GitHub-Actions", "_upstream": "https://github.com/bioc/RBGL", "_commit": { "id": "a71f7ab0c1164bf1614d0dd00b03ff52c46970f7", "author": "A Wokaty ", "committer": "A Wokaty ", "message": "bump x.y.z version to odd y following creation of RELEASE_3_23 branch\n", "time": 1777379419 }, "_maintainer": { "name": "Bioconductor Package Maintainer", "email": "maintainer@bioconductor.org", "login": "bioconductor-bot", "description": "", "uuid": 11681645 }, "_distro": "noble", "_registered": true, "_dependencies": [ { "package": "graph", "role": "Depends" }, { "package": "methods", "role": "Depends" }, { "package": "BH", "role": "LinkingTo" }, { "package": "methods", "role": "Imports" }, { "package": "Rgraphviz", "role": "Suggests" }, { "package": "XML", "role": "Suggests" }, { "package": "RUnit", "role": "Suggests" }, { "package": "BiocGenerics", "role": "Suggests" }, { "package": "BiocStyle", "role": "Suggests" }, { "package": "knitr", "role": "Suggests" } ], "_owner": "bioc", "_selfowned": true, "_usedby": 135, "_updates": [ { "week": "2025-44", "n": 2 }, { "week": "2026-18", "n": 2 } ], "_tags": [], "_bioc": [ { "branch": "devel", "version": "1.89.0", "bioc": "3.24" }, { "branch": "release", "version": "1.88.0", "bioc": "3.23" } ], "_topics": [ "graphandnetwork", "network", "cpp" ], "_userbio": { "uuid": 2286807, "type": "organization", "name": "Bioconductor", "description": "Software for the analysis and comprehension of high-throughput genomic data" }, "_downloads": { "count": 15035, "source": "https://www.bioconductor.org/packages/stats/bioc/RBGL" }, "_mentions": 18, "_searchresults": 334, "_rbuild": "4.6.0", "_assets": [ "extra/citation.cff", "extra/citation.html", "extra/citation.json", "extra/citation.txt", "extra/contents.json", "extra/NEWS.html", "extra/NEWS.txt", "extra/RBGL.html", "manual.pdf" ], "_realowner": "bioc", "_cranurl": false, "_releases": [ { "version": "1.12.0", "date": "2007-06-01" }, { "version": "1.14.0", "date": "2008-01-24" }, { "version": "1.16.0", "date": "2008-05-05" }, { "version": "1.17.2", "date": "2008-10-08" }, { "version": "1.18.0", "date": "2008-11-28" }, { "version": "1.20.0", "date": "2009-05-10" }, { "version": "1.22.0", "date": "2009-11-13" }, { "version": "1.24.0", "date": "2010-05-01" }, { "version": "1.26.0", "date": "2010-10-26" }, { "version": "1.28.0", "date": "2011-04-26" } ], "_exports": [ "articulationPoints", "astarSearch", "aver.wavefront", "bandwidth", "bellman.ford.sp", "betweenness.centrality.clustering", "bfs", "biConnComp", "boyerMyrvoldPlanarityTest", "brandes.betweenness.centrality", "chrobakPayneStraightLineDrawing", "circle.layout", "circleLayout", "clusteringCoef", "clusteringCoefAppr", "connectedComp", "cuthill.mckee.ordering", "dag.sp", "dfs", "dijkstra.sp", "dominatorTree", "edgeConnectivity", "edmonds.karp.max.flow", "edmondsMaxCardinalityMatching", "edmondsOptimumBranching", "extractPath", "floyd.warshall.all.pairs.sp", "fruchtermanReingoldForceDirectedLayout", "gprofile", "graphGenerator", "gursoyAtunLayout", "highlyConnSG", "incremental.components", "init.incremental.components", "is.triangulated", "isKuratowskiSubgraph", "isomorphism", "isStraightLineDrawing", "ith.wavefront", "johnson.all.pairs.sp", "kamada.kawai.spring.layout", "kamadaKawaiSpringLayout", "kCliques", "kCores", "kingOrdering", "kolmogorov.max.flow", "lambdaSets", "lengauerTarjanDominatorTree", "makeBiconnectedPlanar", "makeConnected", "makeMaximalPlanar", "maxClique", "maximumCycleRatio", "maxWavefront", "minCut", "minDegreeOrdering", "minimumCycleRatio", "mstree.kruskal", "mstree.prim", "planarCanonicalOrdering", "planarFaceTraversal", "prim.minST", "push.relabel.max.flow", "randomGraphLayout", "removeSelfLoops", "rms.wavefront", "same.component", "separates", "sequential.vertex.coloring", "sloan.ordering", "sloanStartEndVertices", "sp.between", "sp.between.scalar", "strongComp", "transitive.closure", "transitivity", "tsort" ], "_datasets": [ { "name": "FileDep", "title": "FileDep: a graphNEL object representing a file dependency dataset example in boost graph library", "object": "FileDep", "file": "FileDep.rda", "class": [ "graphNEL" ], "fields": [], "table": false, "tojson": false } ], "_help": [ { "page": "astarSearch", "title": "Compute astarSearch for a graph", "topics": [ "astarSearch" ] }, { "page": "bandwidth", "title": "Compute bandwidth for an undirected graph", "topics": [ "bandwidth" ] }, { "page": "bellman.ford.sp", "title": "Bellman-Ford shortest paths using boost C++", "topics": [ "bellman.ford.sp" ] }, { "page": "bccluster", "title": "Graph clustering based on edge betweenness centrality", "topics": [ "betweenness.centrality.clustering" ] }, { "page": "bfs", "title": "Breadth and Depth-first search", "topics": [ "bfs", "bfs,graph,ANY,ANY-method", "bfs,graph,character,logical-method", "bfs,graph,character,missing-method", "bfs,graph,character-method", "bfs,graph,missing,logical-method", "bfs,graph,missing,missing-method", "bfs,graph-method", "dfs", "dfs,graph,character,ANY-method", "dfs,graph,character,logical-method", "dfs,graph,character,missing-method", "dfs,graph,character-method", "dfs,graph,missing,missing-method" ] }, { "page": "biConnComp", "title": "Compute biconnected components for a graph", "topics": [ "articulationPoints", "biConnComp" ] }, { "page": "boyerMyrvoldPlanarityTest", "title": "boyerMyrvoldPlanarityTest", "topics": [ "boyerMyrvoldPlanarityTest" ] }, { "page": "betweenness", "title": "Compute betweenness centrality for an undirected graph", "topics": [ "brandes.betweenness.centrality" ] }, { "page": "chrobakPayneStraightLineDrawing", "title": "chrobakPayneStraightLineDrawing", "topics": [ "chrobakPayneStraightLineDrawing" ] }, { "page": "clusteringCoef", "title": "Calculate clustering coefficient for an undirected graph", "topics": [ "clusteringCoef" ] }, { "page": "clusteringCoefAppr", "title": "Approximate clustering coefficient for an undirected graph", "topics": [ "clusteringCoefAppr" ] }, { "page": "connectedComp", "title": "Identify Connected Components in an Undirected Graph", "topics": [ "connectedComp" ] }, { "page": "dag.sp", "title": "DAG shortest paths using boost C++", "topics": [ "dag.sp" ] }, { "page": "dijkstra.sp", "title": "Dijkstra's shortest paths using boost C++", "topics": [ "dijkstra.sp" ] }, { "page": "dominatorTree", "title": "Compute dominator tree from a vertex in a directed graph", "topics": [ "dominatorTree", "lengauerTarjanDominatorTree" ] }, { "page": "edgeConn", "title": "computed edge connectivity and min disconnecting set for an undirected graph", "topics": [ "edgeConnectivity" ] }, { "page": "edmondsMaxCardinalityMatching", "title": "edmondsMaxCardinalityMatching", "topics": [ "edmondsMaxCardinalityMatching" ] }, { "page": "edmondsOptimumBranching", "title": "edmondsOptimumBranching", "topics": [ "edmondsOptimumBranching" ] }, { "page": "extractPath", "title": "convert a dijkstra.sp predecessor structure into the path joining two nodes", "topics": [ "extractPath" ] }, { "page": "FileDep", "title": "FileDep: a graphNEL object representing a file dependency dataset example in boost graph library", "topics": [ "FileDep" ] }, { "page": "floyd.warshall.all.pairs.sp", "title": "compute shortest paths for all pairs of nodes", "topics": [ "floyd.warshall.all.pairs.sp" ] }, { "page": "gprofile", "title": "Compute profile for a graph", "topics": [ "gprofile" ] }, { "page": "graphGenerator", "title": "Generate an undirected graph with adjustable clustering coefficient", "topics": [ "graphGenerator" ] }, { "page": "highlyConnSG", "title": "Compute highly connected subgraphs for an undirected graph", "topics": [ "highlyConnSG" ] }, { "page": "incrConnComp", "title": "Compute connected components for an undirected graph", "topics": [ "incremental.components", "init.incremental.components", "same.component" ] }, { "page": "is.triangulated", "title": "Decide if a graph is triangulated", "topics": [ "is.triangulated" ] }, { "page": "isKuratowskiSubgraph", "title": "isKuratowskiSubgraph", "topics": [ "isKuratowskiSubgraph" ] }, { "page": "isomorphism", "title": "Compute isomorphism from vertices in one graph to those in another graph", "topics": [ "isomorphism" ] }, { "page": "isStraightLineDrawing", "title": "isStraightLineDrawing", "topics": [ "isStraightLineDrawing" ] }, { "page": "johnson.all.pairs.sp", "title": "compute shortest path distance matrix for all pairs of nodes", "topics": [ "johnson.all.pairs.sp" ] }, { "page": "kCliques", "title": "Find all the k-cliques in an undirected graph", "topics": [ "kCliques" ] }, { "page": "kCores", "title": "Find all the k-cores in a graph", "topics": [ "kCores" ] }, { "page": "lambdaSets", "title": "Find all the lambda-sets in an undirected graph", "topics": [ "lambdaSets" ] }, { "page": "layout", "title": "Layout an undirected graph in 2D - suspended june 16 2012", "topics": [ "circle.layout", "circleLayout", "fruchtermanReingoldForceDirectedLayout", "gursoyAtunLayout", "kamada.kawai.spring.layout", "kamadaKawaiSpringLayout", "randomGraphLayout" ] }, { "page": "makeBiconnectedPlanar", "title": "makeBiconnectedPlanar", "topics": [ "makeBiconnectedPlanar" ] }, { "page": "makeConnected", "title": "makeConnected", "topics": [ "makeConnected" ] }, { "page": "makeMaximalPlanar", "title": "makeMaximalPlanar", "topics": [ "makeMaximalPlanar" ] }, { "page": "maxFlow", "title": "Compute max flow for a directed graph", "topics": [ "edmonds.karp.max.flow", "kolmogorov.max.flow", "push.relabel.max.flow" ] }, { "page": "maxClique", "title": "Find all the cliques in a graph", "topics": [ "maxClique" ] }, { "page": "maximumCycleRatio", "title": "maximumCycleRatio", "topics": [ "maximumCycleRatio" ] }, { "page": "minCut", "title": "Compute min-cut for an undirected graph", "topics": [ "minCut" ] }, { "page": "minimumCycleRatio", "title": "minimumCycleRatio", "topics": [ "minimumCycleRatio" ] }, { "page": "mstree.kruskal", "title": "Kruskal's minimum spanning tree in boost", "topics": [ "mstree.kruskal" ] }, { "page": "mstree.prim", "title": "Compute minimum spanning tree for an undirected graph", "topics": [ "mstree.prim" ] }, { "page": "ordering", "title": "Compute vertex ordering for an undirected graph", "topics": [ "cuthill.mckee.ordering", "kingOrdering", "minDegreeOrdering", "sloan.ordering" ] }, { "page": "planarCanonicalOrdering", "title": "planarCanonicalOrdering", "topics": [ "planarCanonicalOrdering" ] }, { "page": "planarFaceTraversal", "title": "planarFaceTraversal", "topics": [ "planarFaceTraversal" ] }, { "page": "defunct", "title": "Defunct Functions in Package 'RBGL'", "topics": [ "prim.minST", "RBGL-defunct" ] }, { "page": "RBGL.overview", "title": "RBGL.overview", "topics": [ "RBGL.overview" ] }, { "page": "removeSelfLoops", "title": "remove self loops in a graph", "topics": [ "removeSelfLoops" ] }, { "page": "separates", "title": "A function to test whether a subset of nodes separates two other subsets of nodes.", "topics": [ "separates" ] }, { "page": "coloring", "title": "Compute a vertex coloring for a graph", "topics": [ "sequential.vertex.coloring" ] }, { "page": "sloanStartEndVertices", "title": "sloanStartEndVertices", "topics": [ "sloanStartEndVertices" ] }, { "page": "sp.between", "title": "Dijkstra's shortest paths using boost C++", "topics": [ "sp.between", "sp.between.scalar" ] }, { "page": "strongComp", "title": "Identify Strongly Connected Components", "topics": [ "strongComp" ] }, { "page": "transClosure", "title": "Compute transitive closure of a directed graph", "topics": [ "transitive.closure" ] }, { "page": "transitivity", "title": "Calculate transitivity for an undirected graph", "topics": [ "transitivity" ] }, { "page": "tsort", "title": "topological sort of vertices of a digraph", "topics": [ "tsort" ] }, { "page": "wavefront", "title": "Compute the i-th/max/average/rms wavefront for a graph", "topics": [ "aver.wavefront", "ith.wavefront", "maxWavefront", "rms.wavefront" ] } ], "_rundeps": [ "BH", "BiocGenerics", "generics", "graph" ], "_sysdeps": [ { "shlib": "libstdc++", "package": "libstdc++6", "source": "gcc", "version": "14.2.0-4ubuntu2~24.04.1", "name": "c++", "homepage": "http://gcc.gnu.org/", "description": "GNU Standard C++ Library v3" } ], "_vignettes": [ { "source": "RBGL.Rmd", "filename": "RBGL.html", "title": "RBGL: R interface to boost graph library", "author": "L. Long, VJ Carey, R. Gentleman, Emmanuel Taiwo", "engine": "knitr::rmarkdown", "headings": [ "Basic notations/Preliminaries", "Basics Notations", "Examples in use", "Working with the Bioconductor graph class", "Algorithms from BGL", "Depth First Search", "Breadth First Search", "Shortest paths", "Minimum spanning tree", "Connected components", "Maximum Flow", "Sparse Matrix Ordering", "Edge connectivity and minimum disconnecting set", "Topological sort", "Isomorphism", "Vertex Coloring", "Wavefront, Profiles", "Betweenness Centrality and Clustering", "Algorithms built on RBGL", "Min-Cut", "highlyConnSG", "Algorithms independent from RBGL", "maxClique", "is.triangulated", "separates", "kCores", "kCliques" ], "created": "2023-04-13 19:34:27", "modified": "2023-05-15 15:21:19", "commits": 2 } ], "_score": 9.609334918126752, "_indexed": true, "_nocasepkg": "rbgl", "_universes": [ "bioc", "bioconductor-bot" ], "_binaries": [ { "r": "4.7.0", "os": "linux", "version": "1.89.0", "date": "2026-05-30T07:07:33.000Z", "distro": "noble", "arch": "aarch64", "commit": "a71f7ab0c1164bf1614d0dd00b03ff52c46970f7", "fileid": "4dd3c25d3fc6e5e7886e4f1b2acd1e31aa6ec3159fb3de7aadfcf4479f93fc7b", "status": "success", "check": "WARNING", "buildurl": "https://github.com/r-universe/bioc/actions/runs/26677508932" }, { "r": "4.7.0", "os": "linux", "version": "1.89.0", "date": "2026-05-30T07:07:43.000Z", "distro": "noble", "arch": "x86_64", "commit": "a71f7ab0c1164bf1614d0dd00b03ff52c46970f7", "fileid": "f6ed2001b7e651d4a3e41ca5bd5e1441d704830f900392e12720fa3f0c370820", "status": "success", "check": "WARNING", "buildurl": "https://github.com/r-universe/bioc/actions/runs/26677508932" }, { "r": "4.6.0", "os": "linux", "version": "1.89.0", "date": "2026-05-30T07:07:33.000Z", "distro": "noble", "arch": "aarch64", "commit": "a71f7ab0c1164bf1614d0dd00b03ff52c46970f7", "fileid": "70de1380c170443fe2be624258da700cf48cdbf32d65ac052d698404c590e8fb", "status": "success", "check": "WARNING", "buildurl": "https://github.com/r-universe/bioc/actions/runs/26677508932" }, { "r": "4.6.0", "os": "linux", "version": "1.89.0", "date": "2026-05-30T07:08:07.000Z", "distro": "noble", "arch": "x86_64", "commit": "a71f7ab0c1164bf1614d0dd00b03ff52c46970f7", "fileid": "907975806485504380f2fe30dd13abc254f557b8b18e40b73c1a29e45bab619e", "status": "success", "check": "WARNING", "buildurl": "https://github.com/r-universe/bioc/actions/runs/26677508932" }, { "r": "4.5.3", "os": "mac", "version": "1.89.0", "date": "2026-05-30T09:29:58.000Z", "arch": "aarch64", "commit": "a71f7ab0c1164bf1614d0dd00b03ff52c46970f7", "fileid": "266a7cafa7c8a12288b5521139fa1ee12209807492f7b78493bf16013d88342f", "status": "success", "check": "WARNING", "buildurl": "https://github.com/r-universe/bioc/actions/runs/26677508932" }, { "r": "4.5.3", "os": "mac", "version": "1.89.0", "date": "2026-05-30T07:35:14.000Z", "arch": "x86_64", "commit": "a71f7ab0c1164bf1614d0dd00b03ff52c46970f7", "fileid": "81e010b5fc8fc2046f01e12bf47f014a89117b29c393305d870bd422ff3f54ff", "status": "success", "check": "WARNING", "buildurl": "https://github.com/r-universe/bioc/actions/runs/26677508932" }, { "r": "4.6.0", "os": "mac", "version": "1.89.0", "date": "2026-05-30T09:30:00.000Z", "arch": "aarch64", "commit": "a71f7ab0c1164bf1614d0dd00b03ff52c46970f7", "fileid": "6fc06a49f863a697c7087ef6c044ce23de70612fa14304619e239f26bc0cf34f", "status": "success", "check": "WARNING", "buildurl": "https://github.com/r-universe/bioc/actions/runs/26677508932" }, { "r": "4.6.0", "os": "mac", "version": "1.89.0", "date": "2026-05-30T07:34:14.000Z", "arch": "x86_64", "commit": "a71f7ab0c1164bf1614d0dd00b03ff52c46970f7", "fileid": "056db9a00ed1f25dc4c8ef3c4ca4cd66706137233fabd5a6523acaa18cae9f5c", "status": "success", "check": "WARNING", "buildurl": "https://github.com/r-universe/bioc/actions/runs/26677508932" }, { "r": "4.6.0", "os": "wasm", "version": "1.89.0", "date": "2026-05-30T07:07:22.000Z", "arch": "emscripten", "commit": "a71f7ab0c1164bf1614d0dd00b03ff52c46970f7", "fileid": "f06eefb9ccdef01cce5c345b6b6a69cc69fdd8137fd59a5740f66f39c4ad73bf", "status": "success", "buildurl": "https://github.com/r-universe/bioc/actions/runs/26677508932" }, { "r": "4.7.0", "os": "win", "version": "1.89.0", "date": "2026-05-30T07:06:44.000Z", "arch": "x86_64", "commit": "a71f7ab0c1164bf1614d0dd00b03ff52c46970f7", "fileid": "07a38d4b9db6e86fbe0f7f6cd69dcd71862d150a47230ef3bf21d4a917f922e1", "status": "success", "check": "WARNING", "buildurl": "https://github.com/r-universe/bioc/actions/runs/26677508932" }, { "r": "4.5.3", "os": "win", "version": "1.89.0", "date": "2026-05-30T07:06:47.000Z", "arch": "x86_64", "commit": "a71f7ab0c1164bf1614d0dd00b03ff52c46970f7", "fileid": "3a22b122e2142a2e76e610e7fc470220c28225cabdbe1fb79aa1851b254d2056", "status": "success", "check": "WARNING", "buildurl": "https://github.com/r-universe/bioc/actions/runs/26677508932" }, { "r": "4.6.0", "os": "win", "version": "1.89.0", "date": "2026-05-30T07:06:55.000Z", "arch": "x86_64", "commit": "a71f7ab0c1164bf1614d0dd00b03ff52c46970f7", "fileid": "22eb425edf8a5cf323c3d95092c9c720463b88428470ad839114f2160a964369", "status": "success", "check": "WARNING", "buildurl": "https://github.com/r-universe/bioc/actions/runs/26677508932" } ] }