1. CSC 252 Pallavi Moorthy Homework 5

2. 1.) Vertices, edges From cd../../handout/demo/graph_alg/gw_shortest_path

3. 2.) Multiple edges. Loops From cd../../handout/demo/graph_alg/gw_scc

4. 3.) Undirected Graph From cd../../handout/demo/graph_alg/gw_min_cut

5. 4.) Directed graph (digraph) From cd../../handout/demo/graph_alg/gw_dijkstra

6. 5.) Simple graph (a directed graph with no loops) From cd../../handout/demo/graphwin/graphwin

7. 6a.) Examples of graphs (graphs are either directed or undirected) Left graph from: cd../../handout/demo/graph_alg/gw_min_cut Above graph from: cd../../handout/demo/graph_alg/gw_scc

8. Both graphs from: cd../../handout/demo/graph_alg/gw_basic_graph_algorithms 6b.) Examples of Multigraphs (Multigraphs are like undirected graphs, but they can have both multiple edges between vertices and loops

9. 7.) Special classes of graphs: Complete (at left) and Complete Bipartite (at Right) In a complete graph, all possible edges are formed between pairs of vertices. A bipartite graph is a graph whose vertices can be divided into two classes, and edges can only be formed between the two groups. Below from cd../../handout/demo/graph_alg/gw_shortest_path Below graph from: cd../../handout/demo/graph_alg/gw_basic_graph_algorithms

10. 13.) Path in an undirected graph (path is shown in red) From cd../../handout/demo/graph_alg/gw_min_cut

11. 14.) Path in a directed graph (path is shown in red) From cd../../handout/demo/graph_draw/gw_tutte

12. 15.) Hamilton Path in an Undirected graph (path is shown in red) A Hamilton path covers all of the vertices. From cd../../handout/demo/graph_alg/gw_min_cut

13. 16.) Hamilton Path in a directed graph (path is shown in red) A Hamilton path covers all of the vertices. From cd../../handout/demo/graph_draw/gw_tutte

14. 17.) Cycle in an Undirected graph (cycle is shown in red) Cycle: Each vertex is of degree 2, and edges are connected From cd../../handout/demo/graph_alg/gw_min_cut

15. 18.) Cycle in a directed graph (cycle is shown in red) Cycle: Each vertex is of degree 2, and edges are connected. From cd../../handout/demo/graph_alg/gw_shortest_path

16. 19.) Hamilton Cycle in an Undirected graph (cycle is shown in red) A Hamilton cycle covers all of the vertices. From cd../../handout/demo/graph_alg/gw_min_cut

17. 20.) Hamilton Cycle in a directed graph (cycle is shown in red) A Hamilton cycle covers all of the vertices. From cd../../handout/demo/graph_alg/gw_shortest_path

18. 33.) Tree (This is a binary tree, specifically) From cd../../handout/demo/geowin/gw_bintree

19. 34.) Forest (an unconnected group of trees) From cd../../handout/demo/graph_alg/gw_minimum_spanning_tree

20. 10.) Pallavi’s personal demo: Drawing graphs: an example for each graph layout implemented in LEDA Left: From cd../../handout/demo/graph_draw/gw_spring Middle: From cd../../handout/demo/graph_draw/gw_tutte Right: From cd../../handout/demo/graph_draw/gw_visrep