InfoVis Chapter 3.1 - Networks Introduction
Definitions
To work with Networks the Graph Theory plays an important role.
- Directed Graph
- Undirected Graph
- Arc
- Degree
- A simple graph doesnt have parallel edges (multi-edges) or loops.
- adjacency
- incidence
- complete Graph
- Number of vertices of odd degree is always even
- Subgraph
- Induced Graph
- Multigraph
- bipartite
- Utility Graph
- Walk → Trail → Path → Cycle
- Connectivity
- Component
Colers and Distance
called proper if all adjacent edges or vertecies have different colors.
Distance
- Weighted Graph
- Length of a path is the sum of its weights.
- Geodesic Distance
Graph Traversal
Other Algorithms to traverse a Graph
Minimum weight tour → Chinese Postman Problem
Hamiltonweg, Hamiltontour, Hamiltonkreis