![[R logo]](../../../doc/html/logo.jpg)
| adjMat | adjacency matrix generation for Bioconductor::graph objects |
| Am2Al | Convert adjacency matrix to adjacency 'list' in 2xNE format |
| bfs | Breadth and Depth-first search |
| bfs,graph,ANY,ANY-method | Breadth and Depth-first search |
| bfs,graph-method | Breadth and Depth-first search |
| connectedComp | Identify Connected Components in an Undirected Graph |
| dfs | Breadth and Depth-first search |
| dfs,graph-method | Breadth and Depth-first search |
| dijkstra.sp | Dijkstra's shortest paths using boost C++ |
| edgeConnectivity | computed edge connectivity and min disconnecting set for an undirected graph |
| FileDep | FileDep: a graphNEL object representing a file dependency dataset example in boost graph library |
| makeRecip | revise edgeL of an graphNEL to include all reciprocal edges |
| mstree.kruskal | Kruskal's minimum spanning tree in boost |
| sp.between | Dijkstra's shortest paths using boost C++ |
| strongComp | Identify Strongly Connected Components |
| tsort | topological sort of vertices of a digraph |