The grid_2d_graph
, triangular_lattice_graph
, and hexagonal_lattice_graph
functions correspond to the three :None:None:`regular tilings of the plane`, the square, triangular, and hexagonal tilings, respectively. grid_graph
and hypercube_graph
are similar for arbitrary dimensions. Useful relevant discussion can be found about :None:None:`Triangular Tiling`, and :None:None:`Square, Hex and Triangle Grids`
<Unimplemented 'target' '.. _regular tilings of the plane: https://en.wikipedia.org/wiki/List_of_regular_polytopes_and_compounds#Euclidean_tilings'>
<Unimplemented 'target' '.. _Square, Hex and Triangle Grids: http://www-cs-students.stanford.edu/~amitp/game-programming/grids/'>
<Unimplemented 'target' '.. _Triangular Tiling: https://en.wikipedia.org/wiki/Triangular_tiling'>
Functions for generating grid graphs and lattices
Functions for generating grid graphs and lattices
The grid_2d_graph
, triangular_lattice_graph
, and hexagonal_lattice_graph
functions correspond to the three :None:None:`regular tilings of the plane`, the square, triangular, and hexagonal tilings, respectively. grid_graph
and hypercube_graph
are similar for arbitrary dimensions. Useful relevant discussion can be found about :None:None:`Triangular Tiling`, and :None:None:`Square, Hex and Triangle Grids`
<Unimplemented 'target' '.. _regular tilings of the plane: https://en.wikipedia.org/wiki/List_of_regular_polytopes_and_compounds#Euclidean_tilings'>
<Unimplemented 'target' '.. _Square, Hex and Triangle Grids: http://www-cs-students.stanford.edu/~amitp/game-programming/grids/'>
<Unimplemented 'target' '.. _Triangular Tiling: https://en.wikipedia.org/wiki/Triangular_tiling'>
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them