The Start of my blog

作者原本为项目准备了WinCE的相关工作,但客户突然要求改用Linux,导致之前的努力白费。此外,作者还面临在短时间内熟悉Linux并完成任务的压力,甚至在安装Linux过程中不慎破坏了Windows系统。

  一直在考虑弄个博客,因为去年的事情把QQ空间给关了,想想总得有个地方我让郁闷的时候扯下淡什么的..然后今天中午老板过来跟我说客户要求用linux不用wince,这就宣告了我准备了这么久的工作白做了,有点郁闷,但是习惯了.发现从工作到现在,唯一有点长进的就是这点,逆来顺受,貌似没什么脾气,可能吧,说不定哪天就爆发了. 

  本来觉得选开博客的网站还是比较头疼,以现在犹犹豫豫的性格,我以为要蘑菇很久,后来想想没什么必要,该爽快的时候还是得爽快一点,反正我估计靠写博客出名我这辈子也别指望了,我的目的也就是靠这个东西发发牢骚,看着顺眼就好,当然,选这里很大一部分原因是因为看了优快云的博客里的技术文档看多了,擦出了点火花:-)

  关于linux现在真的比较无语,整个项目的时间还是没变,可我花了这么多时间准备wince,突然就不用了换了个我一头雾水的linux,真的感觉比较茫然.而且今天装linux把windows系统给搞坏了,就希望D盘的东西不要丢掉,那我真的要嗝屁了,半年的劳动成果要是这么一下子就没了,想来也不是我和我老板能接受的事情.保佑周日能弄好,阿门.

  文章算是写完了,其实也没什么别的用意,就是给博客留个戳,算是告诉一不小心逛进我博客的人..我开始写blog了:)

  OK,肚子饿了,煮个泡面先,提前4小时对自己说晚安:DDDDDD 

# my name is: Tianyang Xia # my srn is: 24052103 graph = { 'A':['B','C'], 'B':['A','D','E'], 'C':['A','E','F'], 'D':['B'], 'E':['B','C'], 'F':['C'], } """ give the data of the graph it will be used in the below """ my_start = 'C' # the end of my srn is 3, so I will start from 'C' def dfs(graph,my_start,visit = None): #define the function called "dfs", I will used the function to realize Depth-First Search if visit is None: #I need to make sure that visit is empty, so that the elements which has been visited will not influence the context in the new visit group visit = set() #set up a new visit group visit.add(my_start) #add the element of "start" in the group of visit firstly because I need to start the whole search from the start element print(my_start, end = '-') # make sure that the result will be in the same line, so that the result will looks clean and tidy. for neighbor in graph[my_start]: if neighbor not in visit: dfs(graph, neighbor, visit) """ the text above is the core of the whole DFS, I will explain. The first line means that neighbor group will find the element directly connected to element which was stored in the visit group. Then the second line means it will check if the same element will appear in the group of visit twice. If the element appears in the group for the secong time, the neighbor group will store the value of this element and print out after """ print("The result of Depth-Firstly Search start from my start is:") dfs(graph, my_start) print('-'.join(result)) 检查问题
11-03
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值