请大家帮个忙，用java或c++实现

+++++++++                                                           +++
+++++++++                                                           +++
++++++++                                                            +++
+++++++                                                            ++++
++++++   ++                                                        ++++
+++++   ++                                                         ++++
 +++   ++                                                         +++++
 ++   ++                  +                                    +  +++++
 ++  ++           + ++++                                     ++  ++++++
 +++++    +         ++++     ++++++++                      +++   ++++++
 +++++   +         ++++++ ++++++++++                    +++++   +++++++
  +++             + +++++++++++++++                   +++++    ++++++++
  ++   +       + +++++++++++++++++                    +++     +++++++++
 +++  ++       ++++++++++++++++++                  ++        ++++++++++
 +   +++ +  +++++++++++++++++++                  +++        +++++++++++
 +  ++ +++ ++++++++++++++++++ +                 +++        ++++++++++++
 +  +  ++  ++++++++++++++++++ +                 ++++      +++++++++++++
 ++++ ++ +++++++++++++++++++++                   ++++   ++++++++++++++
 +++++  ++++++++++++++++++++++                   ++++   ++++++++++++++
++++++ +++++++++++++++++++++                     ++++   +++++++++++++ 
++++++++++++++++++++++++++                        ++++  +++++++++++++ 
+++  ++++++++++++++++++++                         ++++  ++++++++++++  
+++  ++++++++++++++++ ++                          ++++  ++++++++++++  
+   +++++++++++++++++++                           +++++ ++++++++++++  
+   +++++++++++++++++++                           +++++ +++++++++++   
  +++++++++++++++++++ +        +                  +++++ +++++++++++   
  ++++++++++++++++++++        +++++               +++++ +++++++++++   
 +++++++++++++++++++             ++++           +++++++  +++++++++    
++++++++++++++++++++       +++++++++++        +++++++++  +++++++++    
+++++++++++++++++++       ++++++++++ +       +++++++++++ +++++++++    
++++++++++++++++++       +++++++ +++++      ++++++++++++ ++++++++     
++++++++++++++++++       +++++++  +++++    +++++ +++++++ ++++++++     
+++++++++++++++++       +++++++    ++++    + ++  +++++++ ++++++++     
++++++++++++++++       +   +++      +++         ++++++++ +++++++      
+++++  ++++++++++     +      ++     +++       ++++++++++ +++++++      
++++++ +++++++++    +++               ++       +++++++++ +++++++      
++++++ ++++++++    ++++               ++        ++++++++ +++++++      
+++++ ++++++++     ++++               ++        ++++++++  +++++       
+++++++ +++++++   +++++                +        ++++++++  +++++       
+++++++  ++++    ++++++                +        ++++++++  +++++       
++++++++++++++   ++++++               ++         +++++++  ++++        
+++++++ + ++    +++++++               ++        ++++++++  ++++        
+++++++ +++++   ++++++++              ++         +++++++  ++++        
+++++ +++++    +++++++++           ++  +        ++++++++  +++         
++++++++++    ++++++++++           ++  ++       +++++++++  ++         
+++++ ++++   +++++++++++           +++++++      +++++++++  ++         
++++++++++   +++++++++++             ++++      ++++++++++  ++         
+ +++++  +  +++++++++++++                      ++++++++++  +          
+++++    + +++++++++++++                       ++++++++++  +          
+++++   +  ++++++++++++++                     +++++++++++  +          
 ++    ++ +++++++++++++++                     +++++++++++             
++     + +++++++++++++++++    +++  +++++ +++ +++++++++++++            
++    +  +++++++++++++++++    ++++++++++ ++  +++++++++++++            
+    +  +++++++++++++++++++    +++++        ++++++++++++++            
+      ++++++++++++++++++++      ++++       ++++++++++++++            
      +++++++++++++++++++++       ++++++   +++++++++++++++            
++   +++++++++++++++++++++++               +++++++++++++++            
++   +++++++++++++++++++++++              ++++++++++++++++            
+++ +++++++++++++++++++++++++             ++++++++++++++++            
 +++++++++++++++++++++++++++++            ++++++++++++++++            
    +++++++++++++++++++++++++++          +++++++++++++++++            
  +  ++++++++++++++++++++++++             ++++++++++++++++  ++        
+ ++  ++++++++++++++++++++++                 +++++++++++++    +++++   
++++   +++++++++++++++++++++++                ++++++++++++      +++++++
++   + ++++++++++++++++++++++                   ++++++++++        +++++
++   ++ +++++++++++++++++++++                    +++++++++          +++
+    + + ++++++++++++++++++++                      ++++++             
++   + +++++++++++++++++++++                       ++++++             
++   ++ +++++++++++++++++++                         +++++             
+++   ++ ++++++++++++++++++                          ++++             
+++   ++ +++++++++++++++++++                         ++++             
 

1.        Finding connected components in a binary image.

a)        An Union-Find data structure should be implemented as an abstract data type (a class in C++) with the following operations.

·           uandf(n): constructs an union-find data type with n elements, 1, 2, . . . , n.

·           make set(i): creates a new set whose only member (and thus representative) is i.

·           union sets(i,j): unites the dynamic sets that contains i and j, respectively, into a new set that is the union of these two sets.

·           find set(i): returns the representative of the set containing i.

·           final sets(): returns the total number of current sets, finalizes the current sets (make set() and union sets() will have no effect after this operation), and resets the representatives of the sets so that integers from 1 to final sets() will be used as representatives.

b)        Design and implement (a program) an algorithm to find the connected components in a binary image using Union-Find data structure in a).

An ASCII file containing a binary image is available (see girl.img and img readme) as the input of your program. The output of the program should be the following in this specified order:

1.        the input binary image,

2.        the connected component image where each component is labelled with a unique character,

3.        a list sorted by component size, where each line of the list contains the size and the label of a component,

4.        same as 2 with the connected component whose size equals to one removed.

关于图的说明：

File girl.img contains a 71 by 71 binary image in plain text.

In this file, a + means 1 and a space means 0. We only consider the connected components of 1.

The total number of components is less than 26. Therefore you can use letters from 'a' to 'z' to identify all the components.

We use 4 connectivity for +. Therefore ++ and + are considered connected.               

However +  and  + are not considered connected.

关于make(i)：make x_i a subset and assigns a name for the subset.

find set(i): returns the name of the subset that contains x_i

union(i, j): combines subsets that contain x_i and x_j, say S_i and S_j, into a new subset with a unique name( any name distinct from other names will).

   

转载于:https://www.cnblogs.com/ugvanxk/archive/2009/02/19/1393729.html