DFS                     Depth First Search
IMCA                    KEGG Integrin Mediated Cell Adhesion graph
aM2bpG                  Coercing matrices to graphs
acc-methods             Methods for Accessibility Lists
addEdge                 addEdge
addNode                 addNode
adj-methods             Methods for finding the adjacency list for
                        selected nodes.
apopGraph               KEGG apoptosis pathway graph
aveNumEdges             Calculate the average number of edges in a
                        graph
biocRepos               A graph representing the Bioconductor package
                        repository
boundary                Returns the Boundary between a Graph and a
                        SubGraph
buildRepDepGraph        Functionality to manage repository dependency
                        graphs
calcProb                Calculate the hypergeometric probability of
                        the subgraph's number of edges.
calcSumProb             Calculate the probability that a subgraph has
                        an unusual number of edges.
clearNode               clearNode
clusterGraph-class      Class "clusterGraph"
coerce,graphNEL,matrix-method
                        Coercing matrices to graphs
combineNodes            combineNodes
distGraph-class         Class "distGraph"
duplicatedEdges         duplicatedEdges
edgeMatrix              Compute an Edge Matrix or weight vector for a
                        Graph
edgeWeights             Retrieve the edge weights for specified
                        indices.
fromGXL-methods         Methods for GXL manipulations in package graph
gEdge-class             Class "gEdge"
gNode-class             Class "gNode"
generalGraph-class      Class "generalGraph" ~~~
graph-class             Class "graph"
graph2SparseM           Coercion methods between graphs and sparse
                        matrices
graphExamples           A List Of Example Graphs
graphID-class           Unique Graph Identifications
graphNEL-class          Class "graphNEL"
hashtable-class         Class "hashtable"
inEdges                 inEdges
listEdges               List the Edges of a Graph
mostEdges               Find the node in a graph with the greatest
                        number of edges
numEdges                Calculate the number of edges in a graph
numNoEdges              Calculate the number of nodes that have an
                        edge list of NULL
randomEGraph            Random Edge Graph
randomGraph             Random Graph
randomNodeGraph         Generate a Graph with specified degree
                        distribution.
removeEdge              removeEdge
removeNode              removeNode
simpleEdge-class        Class "simpleEdge".
startids                Functions to associate identifiers with graph
                        components.
subGraph                Create a Subgraph
ugraph                  Underlying Graph
validGraph              Test whether graph object is valid
write.tlp               Write a graph object in a file in the Tulip
                        format
