I think graph isomorphism algorithms (for exact lattices) or general graph matching is useful for this, potentially.
Gabor On Mon, Aug 10, 2015 at 4:39 PM, Chris Watson <[email protected]> wrote: > Hello, does igraph have an algorithm for determining if a graph is a lattice > (or if its structure is close to that of a lattice graph)? If not, does > anyone know of such an algorithm? > > thanks, > Chris > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
