* Try to implement a symmetry breaker to check if this affects especially the runtime which is needed to close the gap and exclude all unconnected solutions with at most as many nodes as an optimal connected.
- May implement My Ky's, even if it is not optimal/ 100% correct. Just to observe if there is a connection between symmetrical unconnected solutions and the runtime and how strong this connection is. (Possible indicators: runtime, number of lazily added constraints) ❌
- Unfortunately her symmetry breaker made use of edges and our model consists only of node variables.
- Until now there has no symmetry breaker come to my mind and I havend recognised one in a paper yet.
- Until now there has no symmetry breaker come to my mind and I haven't recognised one in a paper yet.
### runtime
* Create random graphs and try to compare runtime between ILP and ASP.
- Measure some characteristics of the graphs such as density, |V|, |E|, maximum degree, minimum degree, average degree, (maybe standard derivation of degree or median degree?)
