Heuristics and ploting for the firefighter problem. Diferent aproach to this combinatorial optimization problem.
There is a node on fire in T = 0.
The fire expreads to each adjacent node that it has.
Your job is to extinguish the fire in the minimal amount of time (T), each T you get to protect N nodes acording of how many Firefigthers you have
Save the node with the highest number of edges
In a graph tree, try to find the biggest sub tree to save
Similar to Degree, try to save the node with highest number of edges but only from the nodes thretened
The graphs are read from a csv file with a adjacenty matrix read using numpy The Graph is plot using the library networkx and matplotlib