January 8, 2012

graph February 17, 2012 DFS Depth First Search Description This function implements algorithm 4.2.1 of Gross and Yellen. The input is a graph and a node to start from. It returns a standard vertex labeling of graph. This is a vector with elements corresponding to the nodes of graph and with values that correspond to point in the depth first search the node is visited. Usage DFS(object, node, checkConn=TRUE) Arguments object An instance of the graph class.

• kegg graph
• original multigraph
• mediated cell adhesion pathway from kegg
• usage data
• nodes
• edge
• vector
• names
• graph
• list