Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8513567
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 11, 20262026-06-11T04:36:26+00:00 2026-06-11T04:36:26+00:00

I would like to know if there is a function that applies an identifier

  • 0

I would like to know if there is a function that applies an identifier to all nodes in a given dendrogram (binary tree).

So I want a function that after it on a given tree would do the following:

attr(tr,"ID")             ## should give 1   or  1 

attr(tr[[1]],"ID")        ## should give 2  or 10

attr(tr[[2]],"ID")        ## should give 3  or 11

attr(tr[[c(1,1)]],"ID")   ##  should give 4  or 100

etc…

And, if given to start with binaryID 110 (ID of Head Node)

it’s 1st child ID should be 1100
it’s 2nd child ID should be 1101

Note:
– dendrapply() applies a function to all nodes in a tree

Package using= “stats”

 D=rbind(
+ c(1,1,1,1,1),
+ c(1,2,1,1,1),
+ c(2,2,2,2,2),
+ c(2,2,2,2,1),
+ c(3,3,3,3,3),
+ c(3,3,3,3,2))

Ddend=as.dendrogram(hclust.vector(D))

funID<-function(tr,StartID){
 .....
 attr(n,"ID")= ID  # for all the nodes in tr
 }

What would funID be?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-11T04:36:28+00:00Added an answer on June 11, 2026 at 4:36 am

    This is code taken from stats:::reorder.dendrogram and modified to suit the purpose of labeling the root and each leaf with an increasing integer. It might not exactly fit your specs but see if it does …

    label.leaves <- 
     function (x, wts) 
     { N=1
         if (!inherits(x, "dendrogram")) 
             stop("we require a dendrogram")
         oV <- function(x, wts) {
             if (is.leaf(x)) {
                 attr(x, "ID") <- N; N <<- N+1
                 return(x)
             }
             k <- length(x)
             if (k == 0L) 
                 stop("invalid (length 0) node in dendrogram")
             vals <- numeric(k)
             for (j in 1L:k) { N <- N+1
                 b <- oV(x[[j]], wts)
                 x[[j]] <- b
                 vals[j] <- N; N <- N+1
             }
           x
         }
         stats:::midcache.dendrogram(oV(x, wts))
     }
    

    Testing:

    > Ddend.L <- label.leaves(Ddend)
    > rapply(Ddend.L, function(x) return( attr(x, "ID") ))
    [1] 1 2 3 4 5 6
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I would like to know if there is, in Java, a function that can
I would like to know if is there any function that search a string
I would like to know if there exists any kind of library or workaround
I would like to know if there is any kind of tool to monitor
I would like to know if there is a method to create share buttons
I would like to know if there's a way in java to find out
I would like to know is there any difference in performance between these two
I would like to know if there is a way to execute polygons queries
I would like to know if there are any good resources (online or books)
I would like to know if there any shorter expression exists, than this: '0000-00-00

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.