Graph conceptsGhdbti(d)dd(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 edgesBB – loopThe shape of the graph does not matter, only the way the nodes areconnected to each otherconnected to each other. Simple graph- does not have loops (self-edges) and does not havedoes not have loops (self edges) and does not have multiple identical edges. Further reading:http://www.utm.edu/departments/math/graph/glossary.html
has intentionally blurred sections.
Sign up to view the full version.
Symmetrical and directed graphsTwo 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 superpositionof two opposite directed edges.