cout<<"圖的基本功能實驗(存儲結構鄰接矩陣)"<<endl; cout<<"=================================="<<endl; cout<<"1.手工建立（有向）圖 "<<endl; cout<<"2.默認數據建立圖 "<<endl; cout<<"3.用鄰接矩陣形式顯示圖 "<<endl; cout<<"4.求圖的結點數和邊數 "<<endl; cout<<"5.求某條邊的權值 "<<endl; cout<<"6.添加結點 "<<endl; cout<<"7.刪除結點 "<<endl; cout<<"8.添加邊 "<<endl; cout<<"9.刪除邊 "<<endl; cout<<"a.深度優先遍歷圖 "<<endl; cout<<"s.廣度優先遍歷圖 "<<endl; cout<<"0.退出 "<<endl;