Skip to content

Project Structure

Hadar Bitan edited this page Jan 11, 2022 · 2 revisions

Graph structure

NodeData

  • Represents a vertice on the graph.
    • id: specific key associated with this node.
    • Location: the location of the node in 3D.
    • <For example: (id, Location)=(0, (1, 1, 1)>

Point3D

  • Represents a location in 3D.
    • X: x value.
    • Y: y value.
    • Z: z value.
    • <For example:(x,y,z)=(1, 1, 0)>

DiGraph

  • Represents an graph based on the nodes and edges.
    • _vertices_dict: a dictionary contains all the vertices of the graph.
    • _src_edge_dict: a nested dictionary containing the edges of the graph according to the scource vertax.
    • _dest_edge_dict: a nested dictionary containing the edges of the graph according to the destination vertax.
    • _mc: counts the changes in the graph.
    • edges_size: the amount of edges.

GraphAlgo

  • The class that contains the whole algorithms that can be used on a graph.
    • graph: the graph that the algorithms being used on.

Clone this wiki locally