{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

c02_graph_conc

c02_graph_conc - Graph concepts Graphs are made up by...

This preview shows pages 1–9. Sign up to view the full content.

Graph concepts G h d b ti ( d ) d d (li k ) Graphs are made up by vertices (nodes) and edges (links) . An edge connects two vertices, or a vertex with itself – loop. AC, AC - multiple edges BB – loop The shape of the graph does not matter, only the way the nodes are connected to each other connected to each other. Simple graph - does not have loops (self-edges) and does not have does not have loops (self edges) and does not have multiple identical edges. Further reading: http://www.utm.edu/departments/math/graph/glossary.html

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Symmetrical and directed graphs Two distinct types of edges: symmetrical and directed (also called arcs). Two different graph frameworks: graph, digraph = directed graph. In the digraph framework a symmetrical edge means the superposition of two opposite directed edges.