@H_404_2@@H_404_2@@H_404_2@

#include <iostream>
#include <string>
#include <vector>
#include <queue>
using namespace std;
template<class V,class W>
class GraphLink
{
	struct Node 
	{
		W _w;
		size_t _src;
		size_t _dst;
		Node* Next;
		Node(int src=0,int dst=0,const W& w=W())
			:_src(src),_dst(dst),_w(w),Next(NULL)
		{}
	};
public:
	GraphLink(const V* vertex,int size,bool isDirection=false)
		:_isDirection(isDirection)
	{
		_vertex.resize(size);
		_table.resize(size);
		
		for(size_t i=0;i<size;i++)
		{
			_vertex[i]=vertex[i];
		}

	}
	int GetIndex(const V& v)
	{
		for (int i=0;i<_vertex.size();i++)
		{
			if(_vertex[i]==v)
				return i;
		}
		throw std::invalid_argument("顶点赋值错误");
	}
	void _AddEdge(size_t src,w);
		}
	}
	void DFS(const V& v)
	{
		vector<bool> visted(_vertex.size(),visted);
			}
			cur=cur->Next;
		}

	}
	void _BFS(size_t src,visted);
	}
	void PrintLink()
	{
		for (size_t i=0;i<_vertex.size();++i)
		{
	     cout<<_vertex[i]<<"["<<i<<"]->";
		  Node* cur=_table[i];
		  while (cur)
		  {
			  cout<<_vertex[cur->_dst]<<" ["<<cur->_dst<<"]"<<cur->_w<<"->";
			  cur=cur->Next;
		  }
		  cout<<"NULL"<<endl;
		}

	}
protected:
	vector<V> _vertex;
	vector<Node*> _table;
	bool _isDirection;
};
void TestGraphLink()
{
	string v[4]={"西安","延安"};
	GraphLink<string,4);//无向图邻接表
	cout<<"无向图邻接表："<<endl;
	gm.AddEdge("西安",100);
	gm.PrintLink();
	cout<<"无向图DFS遍历："<<endl;//深度优先遍历
	gm.DFS("西安");
	gm.DFS("宝鸡");
	gm.DFS("咸阳");
	gm.DFS("延安");
	cout<<"无向图BFS遍历："<<endl;//广度优先遍历
	gm.BFS("西安");
	gm.BFS("宝鸡");
	gm.BFS("咸阳");
	gm.BFS("延安");
	GraphLink<string,true);//有向图邻接表
	cout<<"有向图邻接表："<<endl;
	gm1.AddEdge("西安",100);
	gm1.PrintLink();
	cout<<"有向图DFS遍历："<<endl;//深度优先遍历
	gm1.DFS("西安");
	gm1.DFS("宝鸡");
	gm1.DFS("咸阳");
	gm1.DFS("延安");
	cout<<"有向图BFS遍历："<<endl;//广度优先遍历
	gm1.BFS("西安");
	gm1.BFS("宝鸡");
	gm1.BFS("咸阳");
	gm1.BFS("延安");
}@H_404_2@

#include "Graph.h"
#include "GraphLink.h"
#include<stdlib.h>
int main()
{
	TestGraphMatrix();
	TestGraphLink();
	system("pause");
	return 0;
}@H_404_2@