Python学习日记

 继承关系中关于mro和c3算法

        我个人理解是对于只有一个继承关系的类采用深度遍历算法，而对于继承了多个类的父类则是采用广度优先遍历

mro(a) = [a]+merge( mro(b)+mro(c)+mro(p), [b,c,p])
mro(b) = [b]+merge( mro(d)+mro(e), [d,e] )
mro(c) = [c]+merge([e,m],[f,m,n], [e,f] )
mro(d) = [d]+merge( mro(g)+mro(h), [g,h] )
mro(f) = [f]+merge( mro(m)+mro(n), [m,n] )
mro(h) = [h,k]
mro(b) = [b,d,g,h,k,e,m]
mro(c) = [c,e,f,m,n]

mro(a) = [a]+merge( [b,d,g,h,k,e]+[c,e,f,m,n]+[p], [b,c,p])
mro(a) =[a,b,d,g,h,k,c,e,f,m,n,p]