Package: RBGL 1.83.0

Bioconductor Package Maintainer

RBGL: An interface to the BOOST graph library

A fairly extensive and comprehensive interface to the graph algorithms contained in the BOOST library.

Authors:Vince Carey [aut], Li Long [aut], R. Gentleman [aut], Emmanuel Taiwo [ctb], Bioconductor Package Maintainer [cre]

RBGL_1.83.0.tar.gz
RBGL_1.83.0.zip(r-4.5)RBGL_1.83.0.zip(r-4.4)RBGL_1.83.0.zip(r-4.3)
RBGL_1.83.0.tgz(r-4.4-x86_64)RBGL_1.83.0.tgz(r-4.4-arm64)RBGL_1.83.0.tgz(r-4.3-x86_64)RBGL_1.83.0.tgz(r-4.3-arm64)
RBGL_1.83.0.tar.gz(r-4.5-noble)RBGL_1.83.0.tar.gz(r-4.4-noble)
RBGL_1.83.0.tgz(r-4.4-emscripten)RBGL_1.83.0.tgz(r-4.3-emscripten)
RBGL.pdf |RBGL.html✨
RBGL/json (API)
NEWS

# Install 'RBGL' in R:
install.packages('RBGL', repos = c('https://bioc.r-universe.dev', 'https://cloud.r-project.org'))

Peer review:

Uses libs:
  • c++– GNU Standard C++ Library v3
Datasets:
  • FileDep - FileDep: a graphNEL object representing a file dependency dataset example in boost graph library

On BioConductor:RBGL-1.83.0(bioc 3.21)RBGL-1.82.0(bioc 3.20)

This package does not link to any Github/Gitlab/R-forge repository. No issue tracker or development information is available.

graphandnetworknetworkcpp

9.59 score 134 packages 316 scripts 15k downloads 18 mentions 77 exports 4 dependencies

Last updated 2 months agofrom:e0f422cb79. Checks:OK: 1 WARNING: 8. Indexed: yes.

TargetResultDate
Doc / VignettesOKDec 03 2024
R-4.5-win-x86_64WARNINGDec 03 2024
R-4.5-linux-x86_64WARNINGDec 03 2024
R-4.4-win-x86_64WARNINGDec 03 2024
R-4.4-mac-x86_64WARNINGDec 03 2024
R-4.4-mac-aarch64WARNINGDec 03 2024
R-4.3-win-x86_64WARNINGDec 03 2024
R-4.3-mac-x86_64WARNINGDec 03 2024
R-4.3-mac-aarch64WARNINGDec 03 2024

Exports:articulationPointsastarSearchaver.wavefrontbandwidthbellman.ford.spbetweenness.centrality.clusteringbfsbiConnCompboyerMyrvoldPlanarityTestbrandes.betweenness.centralitychrobakPayneStraightLineDrawingcircle.layoutcircleLayoutclusteringCoefclusteringCoefApprconnectedCompcuthill.mckee.orderingdag.spdfsdijkstra.spdominatorTreeedgeConnectivityedmonds.karp.max.flowedmondsMaxCardinalityMatchingedmondsOptimumBranchingextractPathfloyd.warshall.all.pairs.spfruchtermanReingoldForceDirectedLayoutgprofilegraphGeneratorgursoyAtunLayouthighlyConnSGincremental.componentsinit.incremental.componentsis.triangulatedisKuratowskiSubgraphisomorphismisStraightLineDrawingith.wavefrontjohnson.all.pairs.spkamada.kawai.spring.layoutkamadaKawaiSpringLayoutkCliqueskCoreskingOrderingkolmogorov.max.flowlambdaSetslengauerTarjanDominatorTreemakeBiconnectedPlanarmakeConnectedmakeMaximalPlanarmaxCliquemaximumCycleRatiomaxWavefrontminCutminDegreeOrderingminimumCycleRatiomstree.kruskalmstree.primplanarCanonicalOrderingplanarFaceTraversalprim.minSTpush.relabel.max.flowrandomGraphLayoutremoveSelfLoopsrms.wavefrontsame.componentseparatessequential.vertex.coloringsloan.orderingsloanStartEndVerticessp.betweensp.between.scalarstrongComptransitive.closuretransitivitytsort

Dependencies:BHBiocGenericsgenericsgraph

RBGL: R interface to boost graph library

L. Long, VJ Carey, R. Gentleman, Emmanuel Taiwo

Rendered fromRBGL.Rmdusingknitr::rmarkdownon Dec 03 2024.

Last update: 2023-05-15
Started: 2023-04-13

Readme and manuals

Help Manual

Help pageTopics
Compute astarSearch for a graphastarSearch
Compute bandwidth for an undirected graphbandwidth
Bellman-Ford shortest paths using boost C++bellman.ford.sp
Graph clustering based on edge betweenness centralitybetweenness.centrality.clustering
Breadth and Depth-first searchbfs 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
Compute biconnected components for a grapharticulationPoints biConnComp
boyerMyrvoldPlanarityTestboyerMyrvoldPlanarityTest
Compute betweenness centrality for an undirected graphbrandes.betweenness.centrality
chrobakPayneStraightLineDrawingchrobakPayneStraightLineDrawing
Calculate clustering coefficient for an undirected graphclusteringCoef
Approximate clustering coefficient for an undirected graphclusteringCoefAppr
Identify Connected Components in an Undirected GraphconnectedComp
DAG shortest paths using boost C++dag.sp
Dijkstra's shortest paths using boost C++dijkstra.sp
Compute dominator tree from a vertex in a directed graphdominatorTree lengauerTarjanDominatorTree
computed edge connectivity and min disconnecting set for an undirected graphedgeConnectivity
edmondsMaxCardinalityMatchingedmondsMaxCardinalityMatching
edmondsOptimumBranchingedmondsOptimumBranching
convert a dijkstra.sp predecessor structure into the path joining two nodesextractPath
FileDep: a graphNEL object representing a file dependency dataset example in boost graph libraryFileDep
compute shortest paths for all pairs of nodesfloyd.warshall.all.pairs.sp
Compute profile for a graphgprofile
Generate an undirected graph with adjustable clustering coefficientgraphGenerator
Compute highly connected subgraphs for an undirected graphhighlyConnSG
Compute connected components for an undirected graphincremental.components init.incremental.components same.component
Decide if a graph is triangulatedis.triangulated
isKuratowskiSubgraphisKuratowskiSubgraph
Compute isomorphism from vertices in one graph to those in another graphisomorphism
isStraightLineDrawingisStraightLineDrawing
compute shortest path distance matrix for all pairs of nodesjohnson.all.pairs.sp
Find all the k-cliques in an undirected graphkCliques
Find all the k-cores in a graphkCores
Find all the lambda-sets in an undirected graphlambdaSets
Layout an undirected graph in 2D - suspended june 16 2012circle.layout circleLayout fruchtermanReingoldForceDirectedLayout gursoyAtunLayout kamada.kawai.spring.layout kamadaKawaiSpringLayout randomGraphLayout
makeBiconnectedPlanarmakeBiconnectedPlanar
makeConnectedmakeConnected
makeMaximalPlanarmakeMaximalPlanar
Compute max flow for a directed graphedmonds.karp.max.flow kolmogorov.max.flow push.relabel.max.flow
Find all the cliques in a graphmaxClique
maximumCycleRatiomaximumCycleRatio
Compute min-cut for an undirected graphminCut
minimumCycleRatiominimumCycleRatio
Kruskal's minimum spanning tree in boostmstree.kruskal
Compute minimum spanning tree for an undirected graphmstree.prim
Compute vertex ordering for an undirected graphcuthill.mckee.ordering kingOrdering minDegreeOrdering sloan.ordering
planarCanonicalOrderingplanarCanonicalOrdering
planarFaceTraversalplanarFaceTraversal
Defunct Functions in Package 'RBGL'prim.minST RBGL-defunct
RBGL.overviewRBGL.overview
remove self loops in a graphremoveSelfLoops
A function to test whether a subset of nodes separates two other subsets of nodes.separates
Compute a vertex coloring for a graphsequential.vertex.coloring
sloanStartEndVerticessloanStartEndVertices
Dijkstra's shortest paths using boost C++sp.between sp.between.scalar
Identify Strongly Connected ComponentsstrongComp
Compute transitive closure of a directed graphtransitive.closure
Calculate transitivity for an undirected graphtransitivity
topological sort of vertices of a digraphtsort
Compute the i-th/max/average/rms wavefront for a graphaver.wavefront ith.wavefront maxWavefront rms.wavefront