csbiology / bio-bte-10-l-4 Goto Github PK

Kruskals algorithm is a marginally more complex, but also more potent alternative to Prim's algorithm for finding not only minimum spanning trees but also minimum spanning forests. It could be added to the existing project or used in the future as a new project with the same basics.

Additonal Ressources:
https://algorithms.discrete.ma.tum.de/graph-algorithms/mst-kruskal/index_en.html

Now that multiple students started working on project, we should provide a blog post guide soon.

Please provide:

1. Additional Information -> Testing to give students hints on how to use/find reference implementations to the problem to benchmark their solutions against.

   Examples

   • From Sequencing by Hybridization as an Eulerian Path Problem:
     

   • From Phylogenetic tree reconstruction based on evolutionary distance:
     

2. Additional Information -> Blog post to give hints what definitely must be contained in the blog post and/or project specific requirements for the blog post

   Examples

   • From t-Distributed Stochastic Neighbour Embedding:
     

   • From Sequencing by Hybridization as an Eulerian Path Problem:
     

3. Upload images directly to the repo if possible. It already happened that external images are not available for a period of time (research gate image in prims algorithm project). You can embed the image in a link and link to the original image.