48
edits
Changes
Jump to navigation
Jump to search
Line 33:
Line 33: + + + + +
no edit summary
===Critical path analysis===
===Critical path analysis===
Critical path analysis is used to determine the fastest/most efficient way of completing a series of tasks, which often depend upon each other.
===Kruskal's algorithm===
===Kruskal's algorithm===
Kruskal's algorithm is used to find the minimum spanning tree in an network that you can see all of.
===Prim's algorithm===
===Prim's algorithm===
Prim's algorithm is used to find the minimum spanning tree when only some of a network is visible.
==See also==
==See also==
*[[Computability]]
*[[Computability]]