Introducing 

Prezi AI.

Your new presentation assistant.

Refine, enhance, and tailor your content, source relevant images, and edit visuals quicker than ever before.

Loading…
Transcript

Graph Algoritm

types of graph :

2

1. undirected graph:

-Edges have no direction.

2. Directed graph:

-Edges have direction.

-Edges go from vertex to another.

-the nodes are connected together and not separated.

3. Connected Graph :

4. Disconnected Graph:

5. Complete Graph:

-there is node (or group of nodes) separated from others.

-such as the mesh topology .

- for each n of nodes every node has n-1 edges come in it .

Hasse interval diagram:

4

  • Is some kind of graph used to represent POSET.
  • Called also POSET interval diagram.
  • Start with a directed graph of the relation in which arrows point upward.
  • Then eliminate:

1. the loops at vertices.

2. all arrows whose existence is implied by the transitive property

3. the direction indicators on the arrows

Thank You

EXamples on how to get the 4 terms:

we have to determine 4 terms out of hasse diagram:

1-Maximum:

  • node that doesn't have any edge out (outdegree=0)
  • may be more than one node

2-Minimum:

graph algorithm

  • node that doesn't have any edge in (indegree=0).
  • may be more than .
  • startup node

1

A graph is an abstract notation used to represent the connection between pairs of objects .

consist of:

3-Greatest :

  • Exist only if there is one maximum.

4-Least:

  • Exist only if there is one minimum.
  • Vertices

  • Edges

interconnected objects in a graph

Conclusion

links that connect vertices.

Subtitle

Use this section to wrap-up your presentation and highlight the main points.

Learn more about creating dynamic, engaging presentations with Prezi