I am using R for my bioinformatics research. I am dealing with a graph in
which I need to find all possible path. I was looking for some package that
solve my purpose
but all in vain. There are available algorithms but most of them find
shortest path that ignore other paths So I decided to write my own from
scratch.


I need to create a two dimensional matrix of size nXn.
The element of each entry may contain (node,edge) pair in the form of
bit-vector.

eg. (mat is the matrix)
mat[1,1] = NULL
mat[1,2] = {10000, 10000100}      #first entry is node vector and second
entry is edge vector
mat[1,3] = {{01000, 01001000}, {00100, 01000010}} #Here there are two
node-edge pair. There can be more also, so it is variable.

In other sense it can be said that, the matrix is a 3-d matrix with a
variable third dimension.

I tried the problem with list but I was partially succesful.

Any suggestion in this regard will be highly appreciated.
thanks


---Fahim
Louisville, KY, USA

	[[alternative HTML version deleted]]

