Xiu-zhe (Roger) Luo
Xiu-zhe (Roger) Luo
I just kept this open for later registration so I can have auto-completion for this long name `JuliaRegistrator` ;-)
@JuliaRegistrator register
I think there are some issues with letting `AbstractLattice` being subtype of `AbstractGraph`: - Lattices are not graph exactly, given edges are not well-defined for lattices, on the same lattice,...
So I think this only makes sense for square/rectangle lattice IIUC? I'm actually thinking about maybe we can just flatten the configuration array for helical boundaries when someone needs it?
@dpsanders would you mind showing some more specific case how that was used so maybe we can have a better idea on how to hook it in? I think currently...
e.g when you get the sites of a square lattice, by flattening it to a `Vector`, you automatically get the Helical boundary. Or if you have a periodic boundary for...
I think it is just not yet revised... #4
@mbeach42 tried `CardesianIndex` for high dimensional lattice before #1 , I think we could just use this as site positions? Or do you think we need a type for `site...
As for directed graph, you can always get its edges by simply inverse the order of undirected graph ```jl for (a, b) in edges(lattice) # edge -> a => b...
Thanks for the comment! this is very helpful, since I don't have as much experience on this direction as you. @ffreyer However, I still have some question that I'm not...