リストから組織ツリーを構築しようとしています

Question

私は次の形式の入力ファイルを持っています。私はそれが出力ファイルに次のようなものを見終わるところに、この情報を解析する必要が

Fred,Karl,Technician,2010--Karl,Cathy,VP,2009--Cathy,NULL,CEO,2007-- 
--Vince,Cathy,Technician,2010 

：上部のCEOで

Cathy (CEO) 2007 
-Karl (VP) 2009 
--Fred (Technician) 2010 
-Vince (Technician) 2010 

を、各下位はその優れ下でなければなりません。二番目の名前が何であれ、それは上司です。そのトリックは、従業員が2人の監督者を抱えている場合、上記の直属上司と2回 " - "字下げする必要があるということです。

私はリストを反復処理し、 " - "とコンマで解析しようとしましたが、構造自体に苦労しています。これは私がこれまで持っていたものです。

with open('org_chart_sample.in', 'r') as reader: # Open the input file 
with open('output.out', 'w') as writer: # Make output file writable 
    reader.readline() # Ignore first line 
    lines = reader.readlines() # Read input lines 

    for line in lines:  # Parse out input by the -- which separated attributes of people in the org 
     employees = line.split('--') 
     hierarchy = []  # Exterior list to aid in hierarchy 

     for employee in employees: # Logic that adds to the hierarchy list as algorithm runs 
      info = employee.split(',') 
      hierarchy.append(info) 

私は:(

Answer 1

クールな質問を認めるしたいことをより長くするために、この問題に引っかかってきた、私が徹底的にしよう。上の仕事に楽しかったし、それが終わりました長いの一種なって、私はそれはまだ読める願っています

コード：

########################## 
#Input data cleaned a bit# 
########################## 
lines = ["Fred,Karl,Technician,2010", 
     "Karl,Cathy,VP,2009", 
     "Cathy,NULL,CEO,2007", 
     "Vince,Cathy,Technician,2010", 
     "Mary,NULL,CEO,2010", 
     "Steve,Mary,IT,2013"] 

################################## 
#Worker class to make things neat# 
################################## 
class Worker(object): 
    #Variables assigned to this worker 
    __slots__ = ["name","boss","job","year","employees","level"] 

    #Initialize this worker with a string in the form of: 
    #"name,boss,job,year" 
    def __init__(self,line): 
     self.name,self.boss,self.job,self.year = line.split(",") 
     self.level = 0 if self.boss == "NULL" else -1 #If boss is NULL, they are '0' level 
     self.employees = [] 

    #A function to add another worker as this worker's employee 
    def employ(self,worker): 
     worker.level = self.level+1 
     self.employees.append(worker) 

    #This is a recursive function which returns a string of this worker 
    #and all of this workers employees (depth first) 
    def __repr__(self): 
     rep_str = "" 
     rep_str += "-"*self.level 
     rep_str += str(self.name)+" works for "+str(self.boss) 
     rep_str += " as a "+str(self.job)+" since "+str(self.year)+"\n" 
     for employee in self.employees: 
      rep_str += str(employee) 
     return rep_str 

######################################## 
#Prepare to assign the bosses employees# 
######################################## 
#1. Turn all of the lines into worker objects 
workers = [Worker(line) for line in lines] 

#2. Start from the top level bosses (the ones that had NULL as boss) 
boss_level = 0 

#3. Get a list of all the workers that have a boss_level of 0 
bosses = [w for w in workers if w.level == boss_level] 

#While there are still boses looking to employ then keep going 
while len(bosses) > 0: 
    #For each boss look through all the workers and see if they work for this boss 
    #If they do, employ that worker to the boss 
    for boss in bosses: 
     for worker in workers: 
      if worker.level == -1 and boss.name == worker.boss: 
       boss.employ(worker) 

    #Move down a tier of management to sub-bosses 
    #If there are no sub-bosses at this level, then stop, otherwise while loop again 
    boss_level += 1 
    bosses = [w for w in workers if w.level == boss_level] 

########################## 
#Printing out the workers# 
########################## 
#1. Loop through the top bosses and 
# print out them and all their workers 
top_bosses = [w for w in workers if w.level == 0] 
for top_boss in top_bosses: 
    print top_boss 

出力：

Cathy works for NULL as a CEO since 2007 
-Karl works for Cathy as a VP since 2009 
--Fred works for Karl as a Technician since 2010 
-Vince works for Cathy as a Technician since 2010 

Mary works for NULL as a CEO since 2010 
-Steve works for Mary as a IT since 2013