Dfpt.m

Graph partitioning module. Analyzes the system connectivity graph and creates a list of all connected subgraphs of up to the user-specified size by crawling the graph in all available directions. Syntax:

             subgraphs=dfpt(conmatrix,max_subgraph_size)


Arguments:

              conmatrix   - a matrix with 1 for connected spins
and zeros elsewhere.

      max_subgraph_size   - maximum connected subgraph size in
the resulting subgraph list.


Output: a matrix with each row corresponding to a subgraph. Each row contains 1 for spins that belong to the subgraph and zeros elsewhere.