search

tgrundtvig / Graphs

0 stars 16 forks source link

Handin 6 #1

Open tgrundtvig opened 7 years ago

tgrundtvig commented 7 years ago

  1. You should create a Cycle detection algorithm, that takes a graph as input and as output it returns a cycle in the graph (list of vertices) or null, if there is no cycles in the graph.

  2. You should create an algorithm that takes a DAG (Directed Acyclic Graph) and returns the vertices in a topologically sorted order.

  3. You should create an algorithm, that finds a minimum spanning tree for a given graph.

Handin is the 19. of may. Handin should be made as a pull request on this repository.

ruvazi commented 7 years ago

Hey Tobias

We forgot to fork the excisting project, so we have created a new repository here: https://github.com/ruvazi/AADHand-in-6-graph

// Rune V. ZImsen, Dennis Rønnebæk, Emil R. Pedersen and Ebbe NIelsen