Performance in graph programming

Hello! Anyone can help me with my graph performance??

I've programmed Java code that creates all ways from a given node in a
cyclic directed graph. The problem is that is takes very long creating
a graph with more than 11 nodes and up to 11 connections per node.

Any tips on how to enhance performance??

Please email the answer to : [EMAIL PROTECTED]

Thanks you!
Luis