template <class T, class W>
bool GraphAsLists<T, W>::isStrong(){
	LinkedNode<T, W>* ptr = start;
	for (int i = 0; i < this->nodeNum; i++)
	{
		LinkedNode<T, W>* ptr1 = start;
		while (ptr1 != nullptr)
		{
			Edge<T, W>* pot = findEdge(ptr->node, ptr1->node);
			for (int j = 0; j < nodeNum - i; j++)
			{
				if (pot == nullptr)
					return false;
				pot = findEdge(ptr->node,pot->dest)
			}
				ptr1 = ptr1->next;
		}
		ptr = ptr->next;
	}
	return true;