TABLE OF CONTENTS
TEMANEJO_GRAPH
[ Top ] [ TEMANEJO ] [ Modules ]
NAME
TEMANEJO_GRAPH - the graph class for *Ss' task graph
DESCRIPTION
temanejo_graph.py implements a graph data structure derived from the MultiDiGraph (directed graph with multiple edges) structure from NetworkX.
PORTABILITY
The following modules are imported:
- cairo
- networkx as nx
- colorsys
- time
AUTHOR
Steffen Brinkmann, HLRS <brinkmann@hlrs.de>
COPYRIGHT
(C) HLRS, University of Stuttgart temanejo_graph.py is published under the terms of the BSD license.
ayu_palette_rgb
[ Top ] [ TEMANEJO_GRAPH ] [ Functions ]
NAME
ayu_palette_rgb - palette used for node colouring (infinitely)
DESCRIPTION
This function returns a tuple of RGB values depending on the integer input value. Teh colours will be different enough to be distinguished easily on screen. No information about the total count of input values is needed. Will call ayu_palette_rgb_inf for i>14
INPUTS
- integer value i (as index)
- floating point value s (as saturation) defaults to 1.0
OUTPUT
RGB tuple (r,g,b)
ayu_palette_rgb_g2r
[ Top ] [ TEMANEJO_GRAPH ] [ Functions ]
NAME
ayu_palette_rgb_g2r - palette used for node colouring (green to red)
DESCRIPTION
This function returns a tuple of RGB values depending on the integer input value. Teh colours will be different enough to be distinguished easily on screen. Information about the total count of input values IS needed.
INPUTS
- integer value i (as index)
- floating point value s (as saturation) defaults to 1.0
OUTPUT
RGB tuple (r,g,b)
ayu_palette_rgb_inf
[ Top ] [ TEMANEJO_GRAPH ] [ Functions ]
NAME
ayu_palette_rgb_inf - palette used for node colouring (infinitely)
DESCRIPTION
This function returns a tuple of RGB values depending on the integer input value. Teh colours will be different enough to be distinguished easily on screen. No information about the total count of input values is needed.
INPUTS
- integer value i (as index)
- floating point value s (as saturation) defaults to 1.0
OUTPUT
RGB tuple (r,g,b)
Graph
[ Top ] [ TEMANEJO_GRAPH ] [ Classes ]
NAME
Graph - class for the dependency graph of a *Ss application
DESCRIPTION
Graph implements a data structure representing an directed graph.
DERIVED FROM
NetworkX.MultiDiGraph
METHODS
__init__ get_size add_task add_dep set_status set_threadId set_funcname draw draw_edges draw_nodes drawBox drawShape drawMargin drawTriangle drawDiamond draw_labels get_task_from_xy
square_distance
[ Top ] [ TEMANEJO_GRAPH ] [ Functions ]
NAME
square_distance - returns the square distance of two points (2 dimensions)
DESCRIPTION
This function returns the square distance of two points (x1,y1) and (x2,y2)
INPUTS
floating point values x1, y1, x2, y2
OUTPUT
floating point value of distance = (x2-x1)^2+(y2-y1)^2