Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
判断有向图是否存在欧拉路每个单词只用第一个和最后一个字符,先用并查集判连通(此时当成无向图即可),若连通,判断是否每个点处入度等于出度,如果均等于或只有两个点处不等且这两个点一个入度比出度大1,一个出度比入度大1,则存在欧拉路,否则不存在 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator