Please enable JavaScript.
Coggle requires JavaScript to display documents.
Networks ((Critical Path (Sequence of activites that CANNOT be delayed,…
Networks
-
-
-
-
When drawing; Write in duration on edges to complete activity chart (in terms of Duration, LST, EST)
Minimal spanning trees
Both are; a connecting graph w/ no cycles, multiple edges or loops
-
-
-
-
Shortest Path Problems
-
-
E.g. 
Network Flow Problems
-
E.g.
Eulerian Networks
Eulerian Trails
-
- Start and end on DIFFERENT vertices
Eulerian Circuits
-
- Start and end on the same vertices
-