A n-d transition graph has k-d nodes and all edges that connect two nodes that from a n-d subspace
Examples
g <- ndtransitiongraph(nodes=c('A:B', 'A:F', 'B:C', 'B:F'), n=3, separator=':')
A n-d transition graph has k-d nodes and all edges that connect two nodes that from a n-d subspace
g <- ndtransitiongraph(nodes=c('A:B', 'A:F', 'B:C', 'B:F'), n=3, separator=':')