1.
2.8.2. Union, intersection, and difference of sets
Intersection (1), union (2), and symmetric difference (3) of two sets A and B. Let us imagine that we run a big marriage bureau. The general isolation and ...
2.
5.3.8. Algorithms for graph drawing
There are several approaches for graph drawing, which differ considerably by their methodology. .... Figure 5.31. Straight line embedding of a graph ...
3.
3.1. Dictionaries (class dictionary)
Figure 3.1 shows an English-German dictionary, in which 4 key-value pairs are stored. ... In its implementation, the class dictionary also follows the item ...
4.
5.2.4. Iterating over nodes and edges and navigating in graphs
which can be used to iterate over all nodes and edges of a graph G . The .... To use graph iterators, the header file graph_iterator.h has to be included. ...
5.
5.2.4. Über Knoten und Kanten iterieren und in Graphen navigieren
- [ Translate this page ]Dieser Abschnitt beschreibt die verschiedenen Möglichkeiten, über die Knoten und Kanten eines Graphen zu iterieren und in einem Graphen von Knoten zu Knoten ...
6.
2.2.3. Time complexity, space complexity, and the O-notation
To take this circumstance into account, running time complexities are always specified in the so-called O-notation in computer science. ...
7.
5.3.2. Basic graph algorithms
Figure 5.19 shows a graph with 4 strongly connected components. ... The strongly connected components of a graph can be computed with the function ...
8.
5.3.2. Basic graph algorithms
Figure 5.19 shows a graph with 4 strongly connected components. ... The strongly connected components of a graph can be computed with the function ...
9.
5.3.2. Basic graph algorithms
Figure 5.19 shows a graph with 4 strongly connected components. .... Like many other graph algorithms of LEDA, STRONG_COMPONENTS() expects a directed graph ...
10.
3.4.2. Finger search and fast insertion
Time to insert without finger search: 26.989 Time to insert with finger search from rear: 23.463 Time to insert with finger search from both ends: 24.846 ...
