|
using | graph_t = lemon::ListDigraph |
|
using | node = graph_t::Node |
|
using | edge = graph_t::Arc |
|
|
void | test_insert (node ck, node d, entity_system::entity tarc) |
|
const std::vector< test > & | tests () const |
|
const graph_t & | G () const |
|
std::size_t | nodes_count () const |
|
std::size_t | edges_count () const |
|
node | rise_node_create (entity_system::entity pin) |
|
node | rise_node (entity_system::entity pin) const |
|
node | fall_node_create (entity_system::entity pin) |
|
node | fall_node (entity_system::entity pin) const |
|
void | node_edge (node u, edges e) |
|
edges | node_edge (node u) const |
|
edge | edge_create (node u, node v, edge_types type, entity_system::entity entity) |
|
entity_system::entity | edge_entity (edge e) const |
|
entity_system::entity | pin (node u) const |
|
graph_t::OutArcIt | out_edges_it (node u) const |
|
node | edge_source (edge e) const |
|
node | edge_target (edge e) const |
|
edge_types | edge_type (edge e) const |
|
void | edge_source (edge e, node u) |
|
template<class Iterator > |
void | edge_destroy (const Iterator begin, const Iterator end) |
|
The documentation for this class was generated from the following files:
- /home/csguth/workspace/openeda/src/timing/graph.h
- /home/csguth/workspace/openeda/src/timing/graph.cpp