摘要
ＲｅａｌｉｚａｔｉｏｎｏｆＳｔｒｏｎｇｌｙＣｏｎｎｅｃｔｅｄＤｉｒｅｃｔｉｏｎｏｆａＧｒａｐｈＺｈａｎｇＺｈｉｙｕ；ＺｈａｎｇＭｅｉｙｕ（ＮｏｒｔｈＣｈｉｎａＩｎｓｔｉｔｕｔｅｏｆＴｅｃｈｎｏｌｏｇｙ，Ｔａｉｙｕａｎ，Ｓｈａｎｘｉ，ＰＲＣ，０３０００...
In this paper, we build a theorem which can make a connected graph without a cut edge become a strongly connected digraph. Using this method obtained from the theorem, we can direct the edges of a connected graph without a cut edge,and make it be a strongly connected digraph.Chinese books and reference materials classification number OI 57.5
出处
《昆明理工大学学报（自然科学版）》
CAS
1996年第S1期1-6,共6页
Journal of Kunming University of Science and Technology(Natural Science)
