Trees and Lines tangled

Good morning!
We just moved into our home and have several trees on the front edge of our property that are entangled in telephone and cable lines. We've checked with the local power company and they've assured us that the wires are not theirs and we should contact our phone and cable company. We are curious to know if you do tree trimming or tree removal since the lines are completely surrounding the wires.
Thanks so much!!
As an aside, we LOVE our FiOs service! We came from Sussex county where we had good cable and internet but this is SO MUCH BETTER!
Thanks!!
Alison Stella

Verizon support is in receipt of this issue. We will send you a PM to gather additional information.
Thanks,
Tonya D.
Notice: Content posted by Verizon employees is meant to be informational and does not supersede or change the Verizon Forums User Guidelines or Terms or Service, or your Customer Agreement Terms and Conditions or Plan.

Similar Messages

How to draw a graph of tree structure (using shapes and lines)?

Hello,
I tried to search this solution in the forum, and I see people asking and replying with solutions to similar situation, but I don't get what I am looking for. Also because I have never tried with graphs before.
So, my problem is, I need a function that takes a string with tree structure, as in automata or tree graph, and displays the nodes in tree form. "Tree" is not important, but important is that each object should be displayed as a node and lines connecting them. Please see the image below (with three possible options):
So, basically, the tree structure could be like X(a, X(a,b), c) where X(a,b) is a sub-tree of higher level X. The program knows the parent-child relationship, so this function only needs to display those elements in a graphical fashion.
I pass the string in the form of a 2D array showing the hierarchy (to simplify).
In the image, I am showing three possible options for showing the tree. The third option eliminates those circles and rectangles, if that simplifies.
I hope I explained clearly.
Thanks ahead!
Vaibhav

I would start drawing from the top. The nodes will be the easy part.
Begin with the root node centered in the drawing area horizontally and against the top of the drawing area. The second row of nodes would be located vertically (as in my example) 1.5x pixels below the first one, and either distributed horizontally across the available drawing area or at a fixed distance - like 1.5x again, or someother distance you define.
The tricky part will be drawing the lines since they need run between the edges of nodes. This is where the high-school geometry might come in.
Keep us posted on what you come up with. Extra points for coming up with a solution that will automatically resize itself to fit the available drawing area! (I've already given you all the clues for how to do that too.)
Mike...
Certified Professional Instructor
Certified LabVIEW Architect
LabVIEW Champion
"... after all, He's not a tame lion..."
Be thinking ahead and mark your dance card for NI Week 2015 now: TS 6139 - Object Oriented First Steps

Fonction sketch and line art

Qui à des informations sur la fonction sketch and line art se trouvant dans le menu objet des dernières version de CC ???
Google et l'aide illustrator ne sont pas avares en info sur cette fonctionnalité passé sous silence...

Après recherche et déduction personnelle. Une fois l'application Adobe Sketch installée sur votre tablette et un jolie dessin effectué, une fonction "envoyé vers Illustrator" est disponible dans les menu de partage en haut à droite. Illustrator sur votre pc/mac devrait s'ouvrir sous vos yeux ébahis et devrait faire apparaître votre dessin dans un format non vectoriel. La fonction sketch and line art permet de la vectorisé (la vectorisation dynamique n'étant pas possible pour ce type d'élément apparemment)
J'espère que ca pourra aide quelqu'un

Error When building ess/tra/tre and ess/tra/tre/trs DC's

I had customized the ess/tra/tre and ess/tra/tre/trs DC's and had them working, but I do not know what I did or what happened that am now getting the following errors when building, can anyone help tell what the problem could be?
Error
-     The project was not built since its classpath is incomplete. Cannot find the class file for com.sap.xss.tra.model.openccmodel.OVSOpenCostcenterModel. Fix the classpath then try rebuilding this project.
-     HDI_HNS15.02_Desstratresap.com
Error
-     This compilation unit indirectly references the missing type com.sap.xss.tra.model.openccmodel.OVSOpenCostcenterModel (typically some required class file is referencing a type outside the classpath)
-      InternalVcTreReview.java
-      HDI_HNS15.02_Desstratresap.com/gen_wdp/packages/com/sap/xss/tra/tre/vc/review/wdp
-     line 0

For anyone who might need to know, I managed to fix this by adding tra to the required projects on the build path. On the Navigator View, right click -> Properties -> Java Build Path -> Projects tab -> check dependant project.

Transaction code to learn for sample codes about trees and containers

trnasaction code to learn for sample codes about trees and containers

hi check this....,
REPORT Ztree_TEST_PGM.
Type-pools : fibs,stree.
data : t_node type snodetext.
data : node_tab like t_node occurs 0 with header line.
clear : node_tab, node_tab[].
node_tab-type = 'T'.
node_tab-name = 'Earth'.
node_tab-tlevel = '01'.
node_tab-nlength = '5'.
node_tab-color = '4'.
node_tab-text = 'Hello'.
node_tab-tlength ='5'.
node_tab-tcolor = 3.
append node_tab.
clear node_tab.
node_tab-type = 'P'.
node_tab-name = 'Europe'.
node_tab-tlevel = '02'.
node_tab-nlength = '6'.
node_tab-color = '1'.
node_tab-text = 'Hello'.
node_tab-tlength ='5'.
node_tab-tcolor = 4.
append node_tab.
clear node_tab.
node_tab-type = 'P'.
node_tab-name = 'Germany'.
node_tab-tlevel = '03'.
node_tab-nlength = '7'.
node_tab-color = '4'.
node_tab-text = 'Hello'.
node_tab-tlength ='5'.
node_tab-tcolor = 4.
append node_tab.
clear node_tab.
node_tab-type = 'P'.
node_tab-name = 'Berlin'.
node_tab-tlevel = '04'.
node_tab-nlength = '6'.
node_tab-color = '4'.
node_tab-text = 'Hello'.
node_tab-tlength ='5'.
node_tab-tcolor = 3.
append node_tab.
clear node_tab.
node_tab-type = 'P'.
node_tab-name = 'Asia'.
node_tab-tlevel = '02'.
node_tab-nlength = '4'.
node_tab-color = '1'.
node_tab-text = 'Hello'.
node_tab-tlength ='5'.
node_tab-tcolor = 3.
append node_tab.
clear node_tab.
node_tab-type = 'P'.
node_tab-name = 'India'.
node_tab-tlevel = '03-'.
node_tab-nlength = '5'.
node_tab-color = '1'.
node_tab-text = 'Hello'.
node_tab-tlength ='5'.
node_tab-tcolor = 3.
append node_tab.
clear node_tab.
node_tab-type = 'P'.
node_tab-name = 'Bombay'.
node_tab-tlevel = '04-'.
node_tab-nlength = '6'.
node_tab-color = '1'.
node_tab-text = 'Hello'.
node_tab-tlength ='5'.
node_tab-tcolor = 3.
append node_tab.
clear node_tab.
CALL FUNCTION 'RS_TREE_CONSTRUCT'
TABLES
    NODETAB                  = node_tab .
DATA: type_mapping TYPE stree_ctl_type_mapping_tab.
DATA: wa_type TYPE stree_ctl_type_mapping.
CLEAR: type_mapping[].
    wa_type-type = 'A'.
    wa_type-icon = '@BL@'.
    APPEND wa_type TO type_mapping.
CALL FUNCTION 'RS_TREE_LIST_DISPLAY'
EXPORTING
   USE_CONTROL                     = 'L'.
A list of other function modules that can also be used to construct tree reports:
SEUT,                            Hierarchy framework
RS_TREE_ADD_NODE                 Insert nodes
RS_TREE_AUTOMATIC_REFRESH
RS_TREE_COMPRESS                 Hide subtree(s)
RS_TREE_CONSTRUCT                Construct new hierarchy or insert subtree
RS_TREE_CONTROL_PREPARE
RS_TREE_CREATE                   Create hierarchy
RS_TREE_DELETE_NODE              Delete node with associated sub-tree
RS_TREE_EXPAND                   Expand subtree
RS_TREE_GET_CURRENT_LAYOUT       Get layout information for displayed hierarchy
RS_TREE_GET_CURRENT_NODE         Get node at which cursor is positioned
RS_TREE_GET_CURRENT_ROOT         Get current root node
RS_TREE_GET_CURRENT_TREE         Get structure information for displayed hierarchy
RS_TREE_GET_INPUT                Get entires from input fields
RS_TREE_GET_MARKED_NODES         Get selected nodes
RS_TREE_GET_MODIFICATION_LOG     Get change log for hierarchy
RS_TREE_GET_NODE                 Get nodes for specified ID
RS_TREE_GET_NODE_BY_NAME         Get node for specified node name
RS_TREE_GET_PREDECESSOR          Get preceding node
RS_TREE_GET_SEARCHSTRING         Get last search strinng
RS_TREE_LIST                     Simulate hierarchy or subtree display
RS_TREE_LIST_DISPLAY             Display hierarchy
RS_TREE_LIST_DISPLAY             Display hierarchy
RS_TREE_MODIFY_NODE
RS_TREE_MOVE                     Reassign node with subtree
RS_TREE_POP                      Get hierarchy from the stack and restore
RS_TREE_PUSH                     Place hierarchy on the stack
RS_TREE_RESET_LOCK               Deselect node
RS_TREE_SET_CURRENT_LAYOUT       Set layout with marked cursor position
RS_TREE_SET_CURRENT_TREE         Set other hierarchy
RS_TREE_SET_LOCK                 Select node
RS_TREE_SET_NODE                 Change Nodes
RS_TREE_SET_SCROLL_POS           Position node at the beginning of the page
RS_TREE_SLEEP
RS_TREE_SORT_CHILDREN
regards,
venkat.

Need help with some code ... Searching a tree and inserting data

I'm trying to write code for the addIterative method below.
My problem is that I also need to search the list or node to see if the word exists.
The method add(word,line,position,iterative) validates the parameters; and, in order to update the tree and/or any relevant linked-list, calls either the incomplete method addIterative(word,line,position) or the incomplete method addRecursive(word,line,position). Note the following: if the word is not contained currently in the tree, then all of the (word,line,position) triplet needs to be added to the data structure; otherwise, only the (line,position) pair needs to be added to the data structure. The result must be the same regardless of the algorithmic strategy employed.
any suggestions would be greatly appreciated, new to java, and very lost.
regards,
Jimmy
* Write a description of class Tree091 here.
* @author (your name)
* @version (a version number or a date)
class Tree091 /*(i.e., WordTree)*/
{ private char[] word=null;
private List091 list=null;
private Tree091 precursor=null; /*(i.e., leftSubTree)*/
private Tree091 successor=null; /*(i.e., rightSubTree)*/
public Tree091(char[] word,
List091 list,
Tree091 precursor, /*(i.e., lexicographically < word)*/
Tree091 successor) /*(i.e., lexicographically > word)*/
{ if (word==null) return;
if (word.length<1) return;
if (list==null) return;
this.word=word;
this.list=list;
this.precursor=precursor;
this.successor=successor;
public void add(char[] word,
int line,
int position,
boolean iterative)
{ if (word==null) return;
if (word.length<1) return;
if (line<0) return;
if (position<0) return;
if (iterative)
this.addIterative(word,line,position);
else
this.addRecursive(word,line,position);
private void addIterative(char[] word,
int line,
int position)
/* something goes here*/
private void addRecursive(char[] word,
int line,
int position)
/* something goes here*/
private int compare(char[] array1,
char[] array2)
{ if (array1==null) return -2;
if (array2==null) return -2;
int length1=array1.length;
if (length1==0) return -2;
int length2=array2.length;
if (length2==0) return -2;
int minLength=length1<length2?length1:length2;
for (int i=0; i<minLength; i++)
{ if (array1[i]<array2) return -1;
if (array1[i]>array2[i]) return 1;
return length1==length2 ? 0 : length1<length2 ? -1 : 1;
public boolean contained(char[] word)
{ int compare=compare(this.word,word);
if (compare==1&&this.precursor!=null)
return this.precursor.contained(word);
if (compare==0) return true;
if (compare==-1&&this.successor!=null)
return this.successor.contained(word);
return false;
public int listNodeCount(boolean iterative)
/* something goes here*/
return 24;
public int maximumWordLength(int currentLength)
/* something goes here*/
return 25;
public String toString()
{ String string="";
if (this.precursor!=null) string+=this.precursor;
string+="\""+(new String(this.word))+"\""+this.list;
if (this.successor!=null) string+=this.successor;
return string;
public int treeNodeCount()
/* something goes here*/
return 26;
public String wordArray(int length)
/* something goes here*/
return "hey hey wordarray";

hey,
ok, wow, that was intense, my brain hurts!!!!
And now I've got to go do a graduate program test, argh!!!
A problem I keep getting is trying to figure out what my lecturer is doing in the start of the Tree091 class,
that is, I can see that he is constructing the list and tree but it appears that he is doing it all at the same time, and I'm getting confused with what actually gets inserted into the list, and do we insert the word, line and position, or just the line and position?
Also, I didnt use a 'while loop', I'm not sure how, but I found a 'for loop' in the text book, what do you think of it? Is it ok for now?
And I'm getting an error at this line:
Tree091 ins = new Tree091(char[] word); // getting error '.class' expected here
any ideas?
heres what I've got so far:
private void addIterative(Comparable char[] word,int line, int position){
// Insert char[] word into the this BST
     int direction = 0;
     Tree091 parent = null, curr = root;
     for (;;) {
          if (curr == null) {
               Tree091 ins = new Tree091(char[] word); // getting error '.class' expected here
               // word found so we call insertList method
               insertList091(line, position, List091 precursor);
               if (root) == null)
                    root = ins;
               else if (direction < 0)
                    parent.left = ins;
               else // direction > 0
                    parent.right = ins;
               return;
          direction = elem.compareTo(curr.element);
          if (direction == 0)
               return;
          parent = curr;
          if (direction < 0)
               curr = curr.left;
          else // direction > 0
               curr = curr.right;
}And heres an attempt at the insertList method
private void insertList(char[] word, int line, int position, List091 precursor){
// Insert line and position at a given point in this List091, either after the node
// precursor, or before the first node if precursor is null
// Looking at assignment question we may need a double linked list
     List091 ins = new List091 (char[] word, line, position, null);
     if precursor == null) { //insert before first node (if any).
          ins.successor = first;
          first = ins;
     } else {
          ins.successor = precursor.successor;
          precursor.successor = ins;
}How far off am I Joachim?
cheers,
Jimmy
ps. heres the tree091 class again:
class Tree091 /*(i.e., WordTree)*/
{ private char[] word=null;
private List091 list=null;
private Tree091 precursor=null; /*(i.e., leftSubTree)*/
private Tree091 successor=null; /*(i.e., rightSubTree)*/
public Tree091(char[] word,
                 List091 list,
                 Tree091 precursor, /*(i.e., lexicographically < word)*/
                 Tree091 successor) /*(i.e., lexicographically > word)*/
{ if (word==null) return;
    if (word.length<1) return;
    if (list==null) return;
    this.word=word;
    this.list=list;
    this.precursor=precursor;
    this.successor=successor;
public void add(char[] word,
                  int line,
                  int position,
                  boolean iterative)
{ if (word==null) return;
    if (word.length<1) return;
    if (line<0) return;
    if (position<0) return;
    if (iterative)
      this.addIterative(word,line,position);
    else
      this.addRecursive(word,line,position);
private void addIterative(char[] word,
                            int line,
                            int position)
    /* students to complete */
private void addRecursive(char[] word,
                            int line,
                            int position)
     /* students to complete */
private int compare(char[] array1,
                      char[] array2)
{ if (array1==null) return -2;
    if (array2==null) return -2;
    int length1=array1.length;
    if (length1==0) return -2;
    int length2=array2.length;
    if (length2==0) return -2;
    int minLength=length1<length2?length1:length2;
    for (int i=0; i<minLength; i++)
    { if (array1<array2[i]) return -1;
if (array1[i]>array2[i]) return 1;
return length1==length2 ? 0 : length1<length2 ? -1 : 1;
public boolean contained(char[] word)
{ int compare=compare(this.word,word);
if (compare==1&&this.precursor!=null)
return this.precursor.contained(word);
if (compare==0) return true;
if (compare==-1&&this.successor!=null)
return this.successor.contained(word);
return false;
public int listNodeCount(boolean iterative)
/* students to complete */
public int maximumWordLength(int currentLength)
/* students to complete */
public String toString()
{ String string="";
if (this.precursor!=null) string+=this.precursor;
string+="\""+(new String(this.word))+"\""+this.list;
if (this.successor!=null) string+=this.successor;
return string;
public int treeNodeCount()
/* students to complete */
public String wordArray(int length)
/* students to complete */
Edited by: allergy01 on Apr 25, 2009 9:19 PM
Edited by: allergy01 on Apr 25, 2009 9:20 PM

Problem with trees and memory handling.

Hi there, I just want to know if, when I create a large binary tree, and I re-"pointed" the root pointer to another node somewhere below in that same tree (say, a terminal node), will the "upper" parts of the tree (starting from the new root node) be removed/deleted from memory? Please explain your answers.
Thank you.

f I changed the root to B, will A and its children be
deleted from memory?If you do root = B, AND if nothing else is referring to A or C or anything else beneath them, then A, C, and all of C's children will become eligible for garbage collection.
Whether the memory actually gets cleaned up is something you can't really predict or control, but it doesn't really matter. If it's needed, it will get cleaned up. If it's not needed, it may or may not get cleaned up, but your program won't care.
So, in short, yes, for all intents and purposes, A's, C's, and C's descendants' memory is released when you re-root to B.

Urgent - "Vendor balances carried forward and line items report."

Hello,
Is there any report which will give me the vendor balance carried forward and the line items during that period.
==============================================
Format-
eg: statement taken from 1.8.2006 to 30.9.2006 is required as
Bal b/f 25000 cr.
3.8.2006 Purchase Inv XXX 3000 cr.
5.9.2006 Payment Chq XX 26000 dr.
Bal c/f 2000 cr.
==============================================
Please advise on this.....
Regards,
J

thanks for the response, but i have already tried those transactions.
FK10N will give me the periodic bal statements and NOT line items display which will also have balance carried forward.
F.41 and F.43 again gives the periodic and line items...but i want the vendor balances to be in the format given above..
like say, account statement.
Please advise............
Regards,
J

G/L Balance and Line items difference

Dear Mates,
We have a Inventory-Spare Parts G/L account
When i see the FS10N g/l balances ,there is a figure appearing as 25,82,887/- in the period February and when i double click on the above said figure to see the line items whose total comes to 30,89,627/- with doc.type: WA.
Can please tell me ,what could be reason for the difference between Balance appearing on the initial screen and line items total.
Please treat it very urgent as auditors are sitting on my head.
Thanks
Subbu

Hi,
First let me know the SAP R/3 version and fiscal year.
In the mean time, you can also check any changes has been made to your GL account master data related to line item display.
all the best

S_ALR_87012247 - Customer Balances and Line Items in Local Currency

Hi All,
This report S_ALR_87012247 - Customer Balances and Line Items in Local Currency is not displaying line items for customers in ECC6. Is there any configuration required to get the line items? Please help
Thanks
Sridevi

If you see this report S_ALR_87009950, you will get
Opening Balance at the start of fiscal year
Debits and Credit during the reporting period
and the Cumulative Balance.
Please note the above report will not give you line item details.
S_ALR_87012247 report is specifically for poland, in the description it is mentioned that the line items will be displayed, unfortunately, for other countries, there are no line items visible. Therefore, you may explore the possibility of copying this report and changing the code in order to bring the line items along with the totals.

Spanning Tree and Admin mac address issues srw2048

Ok, I have a somewhat complex problem and hopefully someone may shed some light or have an idea as to whats wrong.
First the scenario:
I have two Cisco Cat 6509's etherchanneled to each other via two fiber cables. One of these is the STP/RSTP root. I have two SRW2048's.. one trunked to each of these 6509 switches. There is also a trunk between the SRW2048's. All this is to create a redundant topology so that if one of the switches fail's the others can still forward packets to each other. Of course the scenario described is in fact a loop that should be handled by STP/RSTP. I have RSTP enabled on all the switches in the scenario (PV RSTP on the cisco switches as they only do Cisco's brand of per vlan spanning tree). There are 3 vlan's configured on each of the srw2048's (2,55,96). There are corresponding vlan's also on the 6509's. I have put the srw2048's management interface into vlan 2.
The problem:
I need to forward packets between the srw2048's primarily and only use the 6509 that is not the root when a failure happens. I have configured the non-root 6509's spanning tree cost on the etherchannel to be higher then the alternate path through the srw's to the root. I can hook everything up and view the spanning tree and see that the srw2048's interface that goes to the non-root 6509 is blocked, and all other interfaces on the other switches are forwarding. I can in fact ping and get to the admin interface on all the switches. Then for some strange reason the admin interface of the srw2048 plugged into the non-root 6509 stops responding. If I disable either the interface its plugged into on the 6509 or the other srw2048 everything starts working again. Sometimes it responds after many failures for no apparent reason. I looked into the mac-address table on the 6509's and they are conflicting, pointing to each other for the mac-address of the broken srw2048. When I clear the mac-table the admin port comes back for about 5 seconds then again goes dark. When reviewing mac-table on the 6509's they are back to pointing to each other. The odd thing (although I haven't confirmed this completely) is that hosts placed into vlan 2 on that same srw2048 seem to work fine. If there was an STP loop or something misconfigured, I would expect it to effect any host in vlan 2 or the other vlan's for that matter on the srw2048 that stops responding. Alas, I am stuck because I need to manage this switch remotely. My only thought is that for some reason even when the STP status is blocked the broken srw2048 is still sending out arp's of its admin interface and bypassing the STP protocol. I have no way to confirm this, but maybe someone has an idea as to what I'm doing wrong, or otherwise offer a solution. For now, I simply removed vlan 2 from the 6509 that the broken srw2048 is plugged into and everything seems fine.
My apologies for such a long post, but this is somewhat complicated. Thanks in advance for any info.
-Geoff
Message Edited by gmyers on 08-19-2008 10:35 PM

To follow up, I had a ticket open with Linksys about this for about 3 months with no resolution. I submitted packet captures, stp outputs, etc and no luck. I gave up and basically had to revert to a manual failover for redundancy. It's no perfect or fast, but it works every time.
Unless linksys issues a firmware upgrade with this as a fix, I doubt we will be able to ever resolve this on our own.

Gr Ir Assignment Updation with PO and Line Item

In the GL for GR IR Account the sort key was not maintained with PO number due to which the assigment field in the line item was getting updated with the posting date and not with the PO & LIne Item details.
We have made the requiste changes and new items are getting updated properly.
But require assitance in updating the earlier line items.
As of date total line items are more than 0.15 mn.
Please suggest some method to automatically update the assigment field of the GR IR Line items with the PO Details.
Regards
Mukesh

Hi,
You can use a substitution to update the field through FI. Use GGB4 for wirting a substitution you may need some ABAP coding to substitute PO no and line items in the assignment field. rule would be Co code =XXX and GL account =xxx and Posting date earlier than =xxxx then concatenrate EBELN and EBELP in Assigment field Zounr.
Then execute FBL3N and edit the assignment field by selecting all the documents and then save it you should see the PO line items populated. You can leave the substitution on or you can remove it after updating,
Regards
K.R

Report with ALV tree and ALV list?

I need to create a report with layout as same as this one
[http://trangiegie.com/MyFile/output.JPG]
It looks like a report with combination of ALV tree and list. The tree works like a navigation bar. Wonder if there are any demo programs like this. Will appreciate any help.

For Tree alone - You can check program : BCALV_TREE_02
Program Name                   Report title
BCALV_GRID_DND_TREE            ALV Grid: Drag and Drop with ALV Tree
BCALV_GRID_DND_TREE_SIMPLE     ALV GRID: Drag and drop with ALV tree (simple)
BCALV_TEST_COLUMN_TREE         Program BCALV_TEST_COLUMN_TREE
BCALV_TEST_SIMPLE_TREE         Program BCALV_TEST_SIMPLE_TREE
BCALV_TREE_01                  ALV Tree Control: Build Up the Hierarchy Tree
BCALV_TREE_02                  ALV Tree Control: Event Handling
BCALV_TREE_03                  ALV Tree Control: Use an Own Context Menu
BCALV_TREE_04                  ALV Tree Control: Add a Button to the Toolbar
BCALV_TREE_05                  ALV Tree Control: Add a Menu to the Toolbar
BCALV_TREE_06                  ALV tree control: Icon column and icon for nodes/items
BCALV_TREE_DEMO                Demo for ALV tree control
BCALV_TREE_DND                 ALV tree control: Drag & Drop within a hierarchy tree
BCALV_TREE_DND_MULTIPLE        ALV tree control: Drag & Drop within a hierarchy tree
BCALV_TREE_EVENT_RECEIVER      Include BCALV_TREE_EVENT_RECEIVER
BCALV_TREE_EVENT_RECEIVER01
BCALV_TREE_ITEMLAYOUT          ALV Tree: Change Item Layouts at Runtime
BCALV_TREE_MOVE_NODE_TEST      Demo for ALV tree control
BCALV_TREE_SIMPLE_DEMO         Program BCALV_TREE_SIMPLE_DEMO
BCALV_TREE_VERIFY              Verifier for ALV Tree and Simple ALV Tree

How to make the values of a combination graph (bar and line) visible always

Hi ,
I am using jdev 11.1.1.6
i have created a combination graph which has a bar and line.
The data with respect to bar and graph were only visible when i keep the mouse pointer on it.
i need to set the values visible always.
kindly let me know how to make it.
In pie graph its by default showing the data always.
regards
Siva

Hi Sameh Nassar,
Thanks for the input, am using the combination graph and i dont have this property added till now.
i tried adding them manually in source but it didn't work. so I assume that this property is good with pie chart alone.
please correct me if am wrong.
This is my combination graph structure.
    <dvt:comboGraph id="comboGraph1"
                      value="#{bindings.testVO1.graphModel}"
                      subType="COMBINATION_VERT_ABS_2Y" shortDesc="Graph 1">
        <dvt:background>
          <dvt:specialEffects/>
        </dvt:background>
        <dvt:graphPlotArea/>
        <dvt:seriesSet markerDisplayed="true">
          <dvt:series lineWidth="0"/>
        </dvt:seriesSet>
        <dvt:o1Axis/>
        <dvt:y1Axis/>
        <dvt:y2Axis/>
        <dvt:legendArea automaticPlacement="AP_NEVER"/>
        <dvt:graphTitle text="Combination graph"/>
        <dvt:o1Title text="x axis"/>
        <dvt:y1Title text="y1 axis"/>
         <dvt:y2Title text="y2 axis"/>
      </dvt:comboGraph>
regards
Siva

How to create a Power View bringing barchart and line chart together in same graph

We are planning to create power view report that has bar and line charts on same graph. Could you please let us know whether it is feasible in Power View & how to add trend line in power view .
Thanks,
Sandeep.

This is not possible with Power View. It is possible with Power BI (Online at PowerBI.com) See image below.
Please vote or mark as answer if you found the response helpful.
Regards, Avi
www.powerpivotpro.com
Wiki:How to ask a Power Pivot Question to get a prompt, accurate and helpful response

Trees and Lines tangled

Similar Messages

Maybe you are looking for