Using this class, you can find an arc in a digraph from a given source to a given target in time O(logd), where d is the out-degree of the source node.
It is not possible to find all parallel arcs between two nodes. Use AllArcLookUp for this purpose.
| GR | The type of the underlying digraph. |
#include <lemon/core.h>
Inheritance diagram for ArcLookUp< GR >:Public Types | |
| typedef GR | Digraph |
| The Digraph type. | |
Public Member Functions | |
| ArcLookUp (const Digraph &g) | |
| Constructor. More... | |
| void | refresh (Node n) |
| Refresh the search data structure at a node. More... | |
| void | refresh () |
| Refresh the full data structure. More... | |
| Arc | operator() (Node s, Node t) const |
| Find an arc between two nodes. More... | |
Constructor.
It builds up the search database, which remains valid until the digraph changes.
|
inline |
Build up the search database of node n.
It runs in time O(d logd), where d is the number of the outgoing arcs of n.
|
inline |
Build up the full search database. In fact, it simply calls refresh(n) for each node n.
It runs in time O(m logD), where m is the number of the arcs in the digraph and D is the maximum out-degree of the digraph.
|
inline |
Find an arc between two nodes in time O(logd), where d is the number of outgoing arcs of s.
| s | The source node. |
| t | The target node. |
s to t if there exists, INVALID otherwise.n, then refresh(n) is enough.
1.8.5