1 / 19

LEDA Graph Win

LEDA Graph Win. Emanuele Altieri October 31, 2000. Vertices and edges. Multiple edges. Loops. Undirected Graph. Directed Graph. Simple Graph. The graph doesn’t have multiple edges. Complete and Bipartite Graphs. Complete Graph All of the nodes in the Graph are connected each other.

wylie-evans
Télécharger la présentation

LEDA Graph Win

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. LEDA Graph Win Emanuele Altieri October 31, 2000

  2. Vertices and edges

  3. Multiple edges. Loops

  4. Undirected Graph

  5. Directed Graph

  6. Simple Graph The graph doesn’t have multiple edges

  7. Complete and Bipartite Graphs Complete Graph All of the nodes in the Graph are connected each other. Bipartite Graph The nodes in the graph are divided into two classes. Edges exist only between nodes of different classes.

  8. Path in Undirected Graphs Simple path. The sub-graph is connected and has two first-degree nodes (0 and 6). The other nodes of the sub-graph are second-degree.

  9. Path in Directed Graphs Simple path. The sub-graph is connected and has one zero-indegree source node (0), and one zero-outdegree destination node (5). The other nodes of the sub-graph are second-degree (1 in/out degree).

  10. Hamilton Path in Undirected Graphs The subgraph is a simple path which spans all of the nodes in the graph

  11. Hamilton Path in Directed Graphs The subgraph is a simple path which spans all of the nodes in the graph

  12. Cycle in Undirected Graphs The bold subgraph above is connected and its vertices are second-degree.

  13. Cycle in Directed Graphs The subgraph is connected and its vertices are 1 indegree and 1 outdegree

  14. Hamilton Cycle in Undirected Graphs The subgraph is a simple cycle which includes all of the nodes in the graph

  15. Hamilton Cycle in Directed Graphs The subgraph is a simple cycle which includes all of the nodes in the graph

  16. Cyclic and Acyclic Digraphs Cyclic Graph The graph contains cycles Acyclic Graph The graph does not contain cycles

  17. Tree The subgraph is a path which is a tree

  18. Forest

  19. Strongly Connected Digraph The graph is connected. All of the nodes in the graph are strongly connected each other.

More Related