Function that creates a N-sized square graph grid

nsquaregraph.jl

using Graphs

# This implementation takes too long to create the graphs, so I'm almost sure it's not the best way (certainly is not the only way)
function nsquaregraph(n::Int)
    # Creating Vertices Array
    newvertices = Array(ExVertex, 0)
    for i in 1:n^2
        vertice = ExVertex(i,"eletron")
        vertice.attributes["spin"] = randspin() # randspin() generates randomically -1 or +1
        newvertices = [newvertices, vertice]
    end
    
    # Creating Edges Array
    n_edge = 4(n-2)^2 + 3*4(n-2) + 4*2
    n_edge = int(n_edge/2)
    newedges = Array(Edge{typeof(newvertices[1])}, 0)
    index = 1
    for i in 1:n-1
        for j in 1:n-1
            whoami = n*(i-1)+j
            newedges = [newedges, Edge(index, newvertices[whoami], newvertices[whoami+n]) # down neighbors
                                , Edge(index+1, newvertices[whoami], newvertices[whoami+1])] # right
            index += 2
        end
        newedges = [newedges, Edge(index, newvertices[n*i], newvertices[n*i+n])] # down neighbor of the elemnt (i,n)
        index += 1
        # exception to treat last line, i represents the column instead of the line
        newedges = [newedges, Edge(index, newvertices[n*(n-1)+i], newvertices[n*(n-1)+i+1])] # neighbor to the right
        index += 1
    end
    return graph(newvertices, newedges, is_directed=false)
end