Honeycomb
0.1
Component-Model Framework
|
A vertex is initially associated with one key and acts like a multi-map, storing all nodes and graph links of DepNodes matching that key. More...
#include <Dep.h>
Public Types | |
typedef stdutil::unordered_map< Vertex *, int, Alloc > | LinkMap |
typedef stdutil::unordered_map< const Vertex *, int, Alloc > | LinkMapConst |
Public Member Functions | |
const NodeList & | nodes () |
Get all nodes that constitute this vertex. More... | |
const NodeListConst & | nodes () const |
const KeyList & | keys () const |
Get all keys mapped to this vertex. More... | |
auto | links (DepType type=DepType::out) -> decltype(honey::keys(declval< const LinkMap >())) |
Get all vertices along in/out links. More... | |
auto | links (DepType type=DepType::out) const -> decltype(honey::keys(declval< const LinkMapConst >())) |
Friends | |
class | DepGraph |
A vertex is initially associated with one key and acts like a multi-map, storing all nodes and graph links of DepNodes matching that key.
After condense() is called cyclical subgraphs will be merged into one vertex. The merged vertex thus becomes associated with all keys in the subgraph.
typedef stdutil::unordered_map<Vertex*, int, Alloc> honey::DepGraph< DepNode_ >::Vertex::LinkMap |
typedef stdutil::unordered_map<const Vertex*, int, Alloc> honey::DepGraph< DepNode_ >::Vertex::LinkMapConst |
|
inline |
Get all keys mapped to this vertex.
|
inline |
Get all vertices along in/out links.
|
inline |
|
inline |
Get all nodes that constitute this vertex.
|
inline |
|
friend |