Networks

Edit Answers
12345678910111213141516171819202122232425
Across
  1. 2. the start of a flow network
  2. 3. a type of network where no vertices are isolated
  3. 6. an edge that begins and finishes at the same vertex
  4. 8. the difference between the EST and LST
  5. 9. a type of tree that connects all vertices of a network
  6. 11. an algorithm for finding a minimum spanning tree for a weighted network by examining edges
  7. 12. an algorithm for finding a minimum spanning tree for a weighted network by examining vertices
  8. 14. a walk with no repeated edges or vertices
  9. 16. a type of network which each edge has a numerical value
  10. 18. a type of scanning to find the LST
  11. 19. the number of edges that are connected to a single vertex
  12. 20. a line between two vertices
  13. 22. the amount of flow an edge of a flow network can hold
  14. 25. lists a series of tasks in order with their completion time
Down
  1. 1. a network that is connected with no cycles
  2. 2. the smallest total edge weight between two vertices
  3. 4. a line which disconnects the source from the sink
  4. 5. the longest time path in a network between the start and finish vertices
  5. 7. the total capacity of all edges leaving the vertex of a flow network
  6. 8. a type of scanning to find the EST
  7. 10. a network diagram
  8. 13. a closed path that returns to the starting vertex
  9. 15. a type of network in which each edge has an arrow
  10. 17. a closed trail that returns to the starting vertex
  11. 21. an activity that has zero time
  12. 23. any route taken through a network
  13. 24. the end of a flow network