NewGraph creates new graph for dijkstra the shortest path calculation.

NewVertex creates instance of Vertex implementing vertexer interface.

Path represents calculated shortest path between to nodes on the graph.

PathVertex is a Vertex on the path with a copy of his Parent.

Vertex describes position in multidimensional space.

Connector describes Vertex connections.

Locator locates Vertex on the graph by unique key.

Positioner describes Vertex position in multidimensional space.

Ruler describes distance between vertexes.

Vertexer allows to get all Vertex related information needed to graph the shortest path.