![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
The reference's complexity map, for either the original or the collapsed graph. More...
#include <line/api/wf/wf_analyzer.h>
Public Attributes | |
| std::size_t | totalNodes = 0 |
| std::size_t | totalLinks = 0 |
| std::size_t | serviceNodes = 0 |
| std::size_t | controlNodes = 0 |
| std::size_t | connectedNodes = 0 |
| T | avgDegree = num_traits<T>::from_int(0) |
The reference's complexity map, for either the original or the collapsed graph.
Definition at line 80 of file wf_analyzer.h.
| T line::wf::WorkflowComplexity< T >::avgDegree = num_traits<T>::from_int(0) |
Definition at line 86 of file wf_analyzer.h.
Referenced by line::wf::workflow_complexity().
| std::size_t line::wf::WorkflowComplexity< T >::connectedNodes = 0 |
Definition at line 85 of file wf_analyzer.h.
Referenced by line::wf::optimized_complexity(), and line::wf::workflow_complexity().
| std::size_t line::wf::WorkflowComplexity< T >::controlNodes = 0 |
Definition at line 84 of file wf_analyzer.h.
Referenced by line::wf::workflow_complexity().
| std::size_t line::wf::WorkflowComplexity< T >::serviceNodes = 0 |
Definition at line 83 of file wf_analyzer.h.
Referenced by line::wf::workflow_complexity().
| std::size_t line::wf::WorkflowComplexity< T >::totalLinks = 0 |
Definition at line 82 of file wf_analyzer.h.
Referenced by line::wf::optimized_complexity(), and line::wf::workflow_complexity().
| std::size_t line::wf::WorkflowComplexity< T >::totalNodes = 0 |
Definition at line 81 of file wf_analyzer.h.
Referenced by line::wf::optimized_complexity(), and line::wf::workflow_complexity().