Package: RBGL 1.89.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.89.0.tar.gz
RBGL_1.89.0.zip(r-4.7)RBGL_1.89.0.zip(r-4.6)RBGL_1.89.0.zip(r-4.5)
RBGL_1.89.0.tgz(r-4.6-x86_64)RBGL_1.89.0.tgz(r-4.6-arm64)RBGL_1.89.0.tgz(r-4.5-x86_64)RBGL_1.89.0.tgz(r-4.5-arm64)
RBGL_1.89.0.tar.gz(r-4.7-arm64)RBGL_1.89.0.tar.gz(r-4.7-x86_64)RBGL_1.89.0.tar.gz(r-4.6-arm64)RBGL_1.89.0.tar.gz(r-4.6-x86_64)
RBGL_1.89.0.tgz(r-4.6-emscripten)
manual.pdf |manual.html✨
DESCRIPTION |NEWS
card.svg |card.png
RBGL/json (API)

# Install 'RBGL' in R:

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

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.89.0(bioc 3.24)RBGL-1.88.0(bioc 3.23)

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

graphandnetwork network cpp

8.43 score 135 packages 334 scripts 18 mentions 77 exports 4 dependencies

Last updated from:a71f7ab0c1. Checks:8 WARNING, 4 NOTE, 2 OK. Indexed: yes.

Target	Result	Time
bioc-checks	WARNING	201
linux-devel-arm64	NOTE	220
linux-devel-x86_64	NOTE	235
source / vignettes	OK	329
linux-release-arm64	NOTE	259
linux-release-x86_64	NOTE	277
macos-release-arm64	WARNING	166
macos-release-x86_64	WARNING	280
macos-oldrel-arm64	WARNING	130
macos-oldrel-x86_64	WARNING	249
windows-devel	WARNING	239
windows-release	WARNING	282
windows-oldrel	WARNING	244
wasm-release	OK	173

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

Dependencies:BH BiocGenerics generics graph

RBGL: R interface to boost graph library

Rendered fromRBGL.Rmdusingknitr::rmarkdown

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

Citation

Development and contributors

Readme and manuals

Help Manual

Help page	Topics
Compute astarSearch for a graph	astarSearch
Compute bandwidth for an undirected graph	bandwidth
Bellman-Ford shortest paths using boost C++	bellman.ford.sp
Graph clustering based on edge betweenness centrality	betweenness.centrality.clustering
Breadth and Depth-first search	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
Compute biconnected components for a graph	articulationPoints biConnComp
boyerMyrvoldPlanarityTest	boyerMyrvoldPlanarityTest
Compute betweenness centrality for an undirected graph	brandes.betweenness.centrality
chrobakPayneStraightLineDrawing	chrobakPayneStraightLineDrawing
Calculate clustering coefficient for an undirected graph	clusteringCoef
Approximate clustering coefficient for an undirected graph	clusteringCoefAppr
Identify Connected Components in an Undirected Graph	connectedComp
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 graph	dominatorTree lengauerTarjanDominatorTree
computed edge connectivity and min disconnecting set for an undirected graph	edgeConnectivity
edmondsMaxCardinalityMatching	edmondsMaxCardinalityMatching
edmondsOptimumBranching	edmondsOptimumBranching
convert a dijkstra.sp predecessor structure into the path joining two nodes	extractPath
FileDep: a graphNEL object representing a file dependency dataset example in boost graph library	FileDep
compute shortest paths for all pairs of nodes	floyd.warshall.all.pairs.sp
Compute profile for a graph	gprofile
Generate an undirected graph with adjustable clustering coefficient	graphGenerator
Compute highly connected subgraphs for an undirected graph	highlyConnSG
Compute connected components for an undirected graph	incremental.components init.incremental.components same.component
Decide if a graph is triangulated	is.triangulated
isKuratowskiSubgraph	isKuratowskiSubgraph
Compute isomorphism from vertices in one graph to those in another graph	isomorphism
isStraightLineDrawing	isStraightLineDrawing
compute shortest path distance matrix for all pairs of nodes	johnson.all.pairs.sp
Find all the k-cliques in an undirected graph	kCliques
Find all the k-cores in a graph	kCores
Find all the lambda-sets in an undirected graph	lambdaSets
Layout an undirected graph in 2D - suspended june 16 2012	circle.layout circleLayout fruchtermanReingoldForceDirectedLayout gursoyAtunLayout kamada.kawai.spring.layout kamadaKawaiSpringLayout randomGraphLayout
makeBiconnectedPlanar	makeBiconnectedPlanar
makeConnected	makeConnected
makeMaximalPlanar	makeMaximalPlanar
Compute max flow for a directed graph	edmonds.karp.max.flow kolmogorov.max.flow push.relabel.max.flow
Find all the cliques in a graph	maxClique
maximumCycleRatio	maximumCycleRatio
Compute min-cut for an undirected graph	minCut
minimumCycleRatio	minimumCycleRatio
Kruskal's minimum spanning tree in boost	mstree.kruskal
Compute minimum spanning tree for an undirected graph	mstree.prim
Compute vertex ordering for an undirected graph	cuthill.mckee.ordering kingOrdering minDegreeOrdering sloan.ordering
planarCanonicalOrdering	planarCanonicalOrdering
planarFaceTraversal	planarFaceTraversal
Defunct Functions in Package 'RBGL'	prim.minST RBGL-defunct
RBGL.overview	RBGL.overview
remove self loops in a graph	removeSelfLoops
A function to test whether a subset of nodes separates two other subsets of nodes.	separates
Compute a vertex coloring for a graph	sequential.vertex.coloring
sloanStartEndVertices	sloanStartEndVertices
Dijkstra's shortest paths using boost C++	sp.between sp.between.scalar
Identify Strongly Connected Components	strongComp
Compute transitive closure of a directed graph	transitive.closure
Calculate transitivity for an undirected graph	transitivity
topological sort of vertices of a digraph	tsort
Compute the i-th/max/average/rms wavefront for a graph	aver.wavefront ith.wavefront maxWavefront rms.wavefront