strongly connected graph

From: Sebi (harko_at_cluj.astral.ro)
Date: 12/29/03 

Date: 29 Dec 2003 01:45:33 -0800

Hi.
This is my first post on this group and my second on usenet. Anyway my
question should be easy for you:Is there any way of checking whether a
directed graph is strongly connected without using any traversal
methods ?
Thanks in advance!