![]() |
dyng
DynamicGraphLayout
|
#include <foresighted_parallel.h>


Public Member Functions | |
| parallel_foresighted_layout (unsigned threads, float tolerance, float canvas_width, float canvas_height, coords center=coords()) | |
| parallel_foresighted_layout (unsigned threads, float tolerance) | |
| Initializes this with a given number of threads and given tolerance. | |
| parallel_foresighted_layout () | |
| Initializes this with the default thread count of 4 and tolerance = 0. | |
| void | set_threads (unsigned count) |
| Sets the thread count. | |
Public Member Functions inherited from dyng::foresighted_layout< StaticLayout > | |
| foresighted_layout (float tolerance, float canvas_width, float canvas_height, coords center=coords()) | |
| foresighted_layout (float tolerance) | |
| void | set_canvas (float w, float h, coords center=coords()) |
| void | set_tolerance (float tolerance) |
| void | use_relative_distance (bool relative) |
| Sets whether to use relative or absolute mental distance calculations. More... | |
| const StaticLayout & | static_layout () const |
| Returns the Layout object used for static layout. | |
| StaticLayout & | static_layout () |
| Returns the Layout object used for static layout. | |
| void | set_cooling (cooling c) |
| Sets a different cooling strategy. | |
| void | operator() (dynamic_graph &dgraph) |
| Performs the algorithm on a dynamic graph. | |
Additional Inherited Members | |
Protected Member Functions inherited from dyng::foresighted_layout< StaticLayout > | |
| void | basic_layout (std::vector< graph_state > &states, float width, float height) |
| void | rescale (graph_state &graph, float src_width, float src_height, float dst_width, float dst_height) const |
| void | move (graph_state &graph, float src_x, float src_y, float dst_x, float dst_y) const |
| node_live_sets | node_live_times (const std::vector< graph_state > &states) const |
| edge_live_sets | edge_live_times (const std::vector< graph_state > &states) const |
| graph_state | calculate_supergraph (const std::vector< graph_state > &animation) const |
| detail::mapped_graph | calculate_gap (const graph_state &supergraph, const node_live_sets &nodes_live, const edge_live_sets &edges_live) const |
| detail::mapped_graph | calculate_rgap (detail::mapped_graph gap) const |
| unsigned | max_nodes (std::vector< graph_state > &states) const |
| float | distance (const graph_state &one, const graph_state &two) const |
Protected Attributes inherited from dyng::foresighted_layout< StaticLayout > | |
| float | m_tolerance |
| float | m_canvas_width |
| float | m_canvas_height |
| coords | m_center |
| cooling | m_cooling { 250, 0.4, [](float t){ return t * 0.977; } } |
| StaticLayout | m_static_layout |
| bool | m_relative_distance = true |
Static Protected Attributes inherited from dyng::foresighted_layout< StaticLayout > | |
| static constexpr float | CalculationHeight = 1 |
A parallel implementation of the Foresighted Layout with Tolerance algorithm. More specifically, it only uses parallel execution in the most performance demanding section.
Produces the same results as foresighted_layout but quicker when tolerance > 0 is used.
(Described in section 6.2)
1.8.17