Program created in C# that generates a graph from the analysis of an image, and produces a vertex for each circle that is in it, in addition to connecting the vertices, if there is no obstacles between them.
Application that detects circles in an image, generates a graph connecting circles without obstructions between them and identifies the minimum path between two nodes using the Dijkstra algorithm. Also, it generates particles that animate above the graph, following a path created with the DFS and BFS algorithms.
Algorithms time comparison
Program created in C# that generates a graph from the analysis of an image, and produces a vertex for each circle that is in it, in addition to connecting the vertices, if there is no obstacles between them.
