Algorithms step by step

[<ivan.todorovic17 AT gmail.com>]

I'am making a demonstrating tool with graphs in java to demonstrate 
algorithms.
For that purpose I am using graphstream library. I have managed to generate
random graph with random weights on the edges and when I'm using their
algorithm library, everything is working just fine (correct edges are 
colored).
Since this is a demonstrating tool i would like to make that algorithm step by
step (on a click of a button) so it paints edges in right order. When I tried
to debug library to see how it is working, it was very complex (millions of
functions/classes combined) and at the end it paints all necessary edges as
result. I'am asking here for advice, should i implement my custom algorithm
which should work step by step, or does someone have expirience and thinks i
should edit it to fit my needs.

Algorithms im planning to cover: (prim, kruskal, dijsktra, bfs, dfs).

Thanks in advance!