Class Method list used by SAP ABAP Class CL_DC_GRAPH_RFW (Graph)
SAP ABAP Class
CL_DC_GRAPH_RFW (Graph) is using
# | Object Type | Object Name | Object Description | Note |
---|---|---|---|---|
![]() |
![]() |
|||
1 | ![]() |
CL_ADAPTER_RFW - ADD_GRAPH | Adapter | |
2 | ![]() |
CL_DC_ASSIGNMENT_RFW - GET_FIRST_ASSIGNMENT | Assignment | |
3 | ![]() |
CL_DC_ASSIGNMENT_RFW - GET_FIRST_NODE | Assignment | |
4 | ![]() |
CL_DC_ASSIGNMENT_RFW - GET_NEXT_ASSIGNMENT | Assignment | |
5 | ![]() |
CL_DC_ASSIGNMENT_RFW - GET_NEXT_NODE | Assignment | |
6 | ![]() |
CL_DC_ASSIGNMENT_RFW - REMOVE_NODE | Assignment | |
7 | ![]() |
CL_DC_DETAIL_RFW - CONSTRUCTOR | RFW: Detail Display/Comparison | |
8 | ![]() |
CL_DC_DETAIL_RFW - INITIALIZE | RFW: Detail Display/Comparison | |
9 | ![]() |
CL_DC_EDGE_RFW - CONSTRUCTOR | Graph Edge | |
10 | ![]() |
CL_DC_EDGE_RFW - GET_EDGE | Graph Edge | |
11 | ![]() |
CL_DC_EDGE_RFW - GET_EDGE | Graph Edge | |
12 | ![]() |
CL_DC_EDGE_RFW - GET_STATUS | Graph Edge | |
13 | ![]() |
CL_DC_EDGE_RFW - SET_STATUS | Graph Edge | |
14 | ![]() |
CL_DC_EDGE_RFW - SET_STATUS | Graph Edge | |
15 | ![]() |
CL_DC_GRAPH_RFW - ADD_EDGE | Graph | |
16 | ![]() |
CL_DC_GRAPH_RFW - ADD_NODE | Graph | |
17 | ![]() |
CL_DC_GRAPH_RFW - CLEAR_ADDITIONAL_NODE_DATA | Graph | SOURCE CALL METHOD clear_additional_node_data. |
18 | ![]() |
CL_DC_GRAPH_RFW - CLEAR_ADDITIONAL_NODE_DATA | Graph | SOURCE CALL METHOD CLEAR_ADDITIONAL_NODE_DATA. |
19 | ![]() |
CL_DC_GRAPH_RFW - DEFAULT_ENUMERATE_NODES | Graph | SOURCE CALL METHOD cl_dc_graph_rfw=>default_enumerate_nodes |
20 | ![]() |
CL_DC_GRAPH_RFW - DEFAULT_ENUMERATE_NODES | Graph | SOURCE EXPORTING |
21 | ![]() |
CL_DC_GRAPH_RFW - DEFAULT_ENUMERATE_NODES | Graph | SOURCE overall_traversing_level = l_overall_traversing_level |
22 | ![]() |
CL_DC_GRAPH_RFW - DEFAULT_ENUMERATE_NODES | Graph | SOURCE graph = me |
23 | ![]() |
CL_DC_GRAPH_RFW - DEFAULT_ENUMERATE_NODES | Graph | SOURCE CHANGING nodes = nodes |
24 | ![]() |
CL_DC_GRAPH_RFW - DEFAULT_ENUMERATE_NODES | Graph | SOURCE next_index = l_next_index |
25 | ![]() |
CL_DC_GRAPH_RFW - DEFAULT_ENUMERATE_NODES | Graph | SOURCE . |
26 | ![]() |
CL_DC_GRAPH_RFW - DELETE_EDGE | Graph | SOURCE CALL METHOD delete_edge |
27 | ![]() |
CL_DC_GRAPH_RFW - DELETE_EDGE | Graph | SOURCE EXPORTING node_from = node |
28 | ![]() |
CL_DC_GRAPH_RFW - DELETE_EDGE | Graph | SOURCE node_to = l_successor |
29 | ![]() |
CL_DC_GRAPH_RFW - DELETE_EDGE | Graph | SOURCE . |
30 | ![]() |
CL_DC_GRAPH_RFW - DELETE_EDGE | Graph | SOURCE CALL METHOD delete_edge |
31 | ![]() |
CL_DC_GRAPH_RFW - DELETE_EDGE | Graph | SOURCE EXPORTING node_from = l_predecessor |
32 | ![]() |
CL_DC_GRAPH_RFW - DELETE_EDGE | Graph | SOURCE node_to = node |
33 | ![]() |
CL_DC_GRAPH_RFW - DELETE_EDGE | Graph | SOURCE . |
34 | ![]() |
CL_DC_GRAPH_RFW - GET_ANCHORS | Graph | SOURCE CALL METHOD get_anchors. |
35 | ![]() |
CL_DC_GRAPH_RFW - GET_GRAPH_TEXT | Graph | |
36 | ![]() |
CL_DC_GRAPH_RFW - GET_GRAPH_TEXT | Graph | |
37 | ![]() |
CL_DC_GRAPH_RFW - GET_NEIGHBORS | Graph | |
38 | ![]() |
CL_DC_GRAPH_RFW - GET_NEIGHBORS | Graph | |
39 | ![]() |
CL_DC_GRAPH_RFW - GET_NODES_OF_SUBTREE | Graph | SOURCE CALL METHOD me->get_nodes_of_subtree |
40 | ![]() |
CL_DC_GRAPH_RFW - GET_NODES_OF_SUBTREE | Graph | SOURCE EXPORTING |
41 | ![]() |
CL_DC_GRAPH_RFW - GET_NODES_OF_SUBTREE | Graph | SOURCE node = node |
42 | ![]() |
CL_DC_GRAPH_RFW - GET_NODES_OF_SUBTREE | Graph | SOURCE ascending_order = 'X' |
43 | ![]() |
CL_DC_GRAPH_RFW - GET_NODES_OF_SUBTREE | Graph | SOURCE IMPORTING |
44 | ![]() |
CL_DC_GRAPH_RFW - GET_NODES_OF_SUBTREE | Graph | SOURCE subtree = subtree |
45 | ![]() |
CL_DC_GRAPH_RFW - GET_NODES_OF_SUBTREE | Graph | SOURCE . |
46 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE CALL METHOD GET_NODE_BY_INDEX |
47 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE EXPORTING IGNORE_STATUS = IGNORE_STATUS |
48 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE IMPORTING NODE_TEXT = NODE_TEXT |
49 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE ATTRIBUTES_ADM = ATTRIBUTES_ADM |
50 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE ATTRIBUTES = ATTRIBUTES |
51 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE NODE = NODE |
52 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE NODETYPE = NODETYPE |
53 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE CHANGING CURRENT_INDEX = CURRENT_NODE_INDEX |
54 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE EXCEPTIONS NOT_FOUND = 1 |
55 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE . |
56 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE CALL METHOD GET_NODE_BY_INDEX |
57 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE EXPORTING IGNORE_STATUS = IGNORE_STATUS |
58 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE IMPORTING NODE_TEXT = NODE_TEXT |
59 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE ATTRIBUTES_ADM = ATTRIBUTES_ADM |
60 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE ATTRIBUTES = ATTRIBUTES |
61 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE NODE = NODE |
62 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE NODETYPE = NODETYPE |
63 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE CHANGING CURRENT_INDEX = CURRENT_NODE_INDEX |
64 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE EXCEPTIONS NOT_FOUND = 1 |
65 | ![]() |
CL_DC_GRAPH_RFW - GET_NODE_BY_INDEX | Graph | SOURCE . |
66 | ![]() |
CL_DC_GRAPH_RFW - MARK_ALL_SUCCESSORS | Graph | SOURCE CALL METHOD mark_all_successors |
67 | ![]() |
CL_DC_GRAPH_RFW - MARK_ALL_SUCCESSORS | Graph | SOURCE EXPORTING root = l_node-node |
68 | ![]() |
CL_DC_GRAPH_RFW - MARK_ALL_SUCCESSORS | Graph | SOURCE . |
69 | ![]() |
CL_DC_GRAPH_RFW - RELOAD_NODES | Graph | |
70 | ![]() |
CL_DC_GRAPH_RFW - SET_TRAVERSING_CIRCULAR_WAVES | Graph | |
71 | ![]() |
CL_DC_GRAPH_RFW - SET_TRAVERSING_SORTED_COLUMN | Graph | |
72 | ![]() |
CL_DC_GRAPH_RFW - SUBTREE_RECURSIVE_SEARCH | Graph | SOURCE CALL METHOD me->subtree_recursive_search |
73 | ![]() |
CL_DC_GRAPH_RFW - SUBTREE_RECURSIVE_SEARCH | Graph | SOURCE EXPORTING |
74 | ![]() |
CL_DC_GRAPH_RFW - SUBTREE_RECURSIVE_SEARCH | Graph | SOURCE hierarchy_index = l_next_hierarchy_index |
75 | ![]() |
CL_DC_GRAPH_RFW - SUBTREE_RECURSIVE_SEARCH | Graph | SOURCE predecessors = l_first_node |
76 | ![]() |
CL_DC_GRAPH_RFW - SUBTREE_RECURSIVE_SEARCH | Graph | SOURCE CHANGING |
77 | ![]() |
CL_DC_GRAPH_RFW - SUBTREE_RECURSIVE_SEARCH | Graph | SOURCE tab_subtree = subtree |
78 | ![]() |
CL_DC_GRAPH_RFW - SUBTREE_RECURSIVE_SEARCH | Graph | SOURCE . |
79 | ![]() |
CL_DC_GRAPH_RFW - SUBTREE_RECURSIVE_SEARCH | Graph | SOURCE call method subtree_recursive_search |
80 | ![]() |
CL_DC_GRAPH_RFW - SUBTREE_RECURSIVE_SEARCH | Graph | SOURCE exporting |
81 | ![]() |
CL_DC_GRAPH_RFW - SUBTREE_RECURSIVE_SEARCH | Graph | SOURCE hierarchy_index = l_new_hier_level |
82 | ![]() |
CL_DC_GRAPH_RFW - SUBTREE_RECURSIVE_SEARCH | Graph | SOURCE predecessors = l_successors |
83 | ![]() |
CL_DC_GRAPH_RFW - SUBTREE_RECURSIVE_SEARCH | Graph | SOURCE changing |
84 | ![]() |
CL_DC_GRAPH_RFW - SUBTREE_RECURSIVE_SEARCH | Graph | SOURCE tab_subtree = tab_subtree |
85 | ![]() |
CL_DC_GRAPH_RFW - SUBTREE_RECURSIVE_SEARCH | Graph | SOURCE . |
86 | ![]() |
CL_DC_NODETYPE_RFW - GET_ATTRIBUTES_ADM | Type of a Graph Node | |
87 | ![]() |
CL_DC_NODETYPE_RFW - GET_ATTRIBUTES_ADM | Type of a Graph Node | |
88 | ![]() |
CL_DC_NODE_RFW - GET_ATTRIBUTES | Graph Node | |
89 | ![]() |
CL_DC_NODE_RFW - GET_ATTRIBUTES | Graph Node | |
90 | ![]() |
CL_DC_NODE_RFW - GET_ATTRIBUTES | Graph Node | |
91 | ![]() |
CL_DC_NODE_RFW - GET_ATTRIBUTES_ADM | Graph Node | |
92 | ![]() |
CL_DC_NODE_RFW - GET_ATTRIBUTE_VALUE | Graph Node | |
93 | ![]() |
CL_DC_NODE_RFW - GET_NODETYPE | Graph Node | |
94 | ![]() |
CL_DC_NODE_RFW - GET_NODETYPE | Graph Node | |
95 | ![]() |
CL_DC_NODE_RFW - GET_NODETYPE | Graph Node | |
96 | ![]() |
CL_DC_NODE_RFW - GET_STATUS | Graph Node | |
97 | ![]() |
CL_DC_NODE_RFW - GET_STATUS | Graph Node | |
98 | ![]() |
CL_DC_NODE_RFW - GET_TEXT | Graph Node | |
99 | ![]() |
CL_DC_NODE_RFW - SET_ATTRIBUTES | Graph Node | |
100 | ![]() |
CL_DC_NODE_RFW - SET_STATUS | Graph Node | |
101 | ![]() |
CL_DC_NODE_RFW - SET_STATUS | Graph Node | |
102 | ![]() |
CL_DC_SORT_RFW - REFRESH_DYN_FIELDS | Graph Sorting | |
103 | ![]() |
CL_EXITHANDLER - GET_INSTANCE | Class for Ext. Services Within Framework of Exit Technique | |
104 | ![]() |
IF_EX_DC_GRAPH_RFW - CHANGE_NODE | BAdI-Interface IF_EX_DC_GRAPH_RFW | |
105 | ![]() |
IF_EX_DC_GRAPH_RFW - DELETE_EDGE | BAdI-Interface IF_EX_DC_GRAPH_RFW | |
106 | ![]() |
IF_EX_DC_GRAPH_RFW - DELETE_NODE | BAdI-Interface IF_EX_DC_GRAPH_RFW | |
107 | ![]() |
IF_EX_DC_GRAPH_RFW - ENUMERATE_NODES_OF_GRAPH | BAdI-Interface IF_EX_DC_GRAPH_RFW | |
108 | ![]() |
IF_EX_DC_GRAPH_RFW - GET_NODETYPES | BAdI-Interface IF_EX_DC_GRAPH_RFW | |
109 | ![]() |
IF_EX_DC_GRAPH_RFW - GET_NODETYPE_FOR_NEW_NODE | BAdI-Interface IF_EX_DC_GRAPH_RFW | |
110 | ![]() |
IF_EX_DC_GRAPH_RFW - INITIALIZE | BAdI-Interface IF_EX_DC_GRAPH_RFW | |
111 | ![]() |
IF_EX_DC_GRAPH_RFW - INSERT_NODE | BAdI-Interface IF_EX_DC_GRAPH_RFW | |
112 | ![]() |
IF_EX_DC_GRAPH_RFW - READ_GRAPH | BAdI-Interface IF_EX_DC_GRAPH_RFW | |
113 | ![]() |
IF_EX_DC_GRAPH_RFW - RELOAD_NODE | BAdI-Interface IF_EX_DC_GRAPH_RFW | |
114 | ![]() |
IF_EX_DC_GRAPH_RFW - SAVE | BAdI-Interface IF_EX_DC_GRAPH_RFW |