Skip to content

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.

Notifications You must be signed in to change notification settings

LuisMedinaG/Graph-analyzer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

25 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Graph analyzer

Description

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.

Visuals

Kruskal algorithm

enter image description here

Prey hunter game

enter image description here

Closest pair of points

Algorithms time comparison

enter image description here

License

MIT

About

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.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages