On 10 Mag, 16:52, Alexander Schliep <[EMAIL PROTECTED]> wrote:
> andrea <[EMAIL PROTECTED]> writes:
> > On 9 Mag, 09:10, Alexander Schliep <[EMAIL PROTECTED]> wrote:
> >> Check outhttp://gato.sf.net(LGPLlicense). It does exactly what you
> >> want to do and there is a binary for MacOS X. Algorithms
andrea <[EMAIL PROTECTED]> writes:
> On 9 Mag, 09:10, Alexander Schliep <[EMAIL PROTECTED]> wrote:
>> Check outhttp://gato.sf.net(LGPL license). It does exactly what you
>> want to do and there is a binary for MacOS X. Algorithms are implemented
>> using Gato's graph class and rudimentary visualiz
On 9 Mag, 09:10, Alexander Schliep <[EMAIL PROTECTED]> wrote:
> andrea <[EMAIL PROTECTED]> writes:
> > Well then I wanted to draw graphs and I found that pydot is working
> > really nicely.
> > BUT I'd like to do this, an interactive program to see ho the
> > algorithms works...
> > For example in
andrea <[EMAIL PROTECTED]> writes:
> Well then I wanted to draw graphs and I found that pydot is working
> really nicely.
> BUT I'd like to do this, an interactive program to see ho the
> algorithms works...
> For example in the breath search first, every time the algorithm
> colors a node, the pr
In <[EMAIL PROTECTED]>, andrea wrote:
> Interesting but what do you mean for two graph-implementatio that
> share the same interface??
> I don't have abstract classes or interfaces in python, am I wrong?
You are thinking of some kind of types or enforcements. If two classes
have some methods wit
On 8 Mag, 13:55, "Diez B. Roggisch" <[EMAIL PROTECTED]> wrote:
> > Ok thank you very much I'll try with that.
> > But I have some design doubts, I'd like to keep the algorithm (for
> > example bfs) as clean as possible, being independent from the drawing
> > methods.
> > And how could I make it ste
> Ok thank you very much I'll try with that.
> But I have some design doubts, I'd like to keep the algorithm (for
> example bfs) as clean as possible, being independent from the drawing
> methods.
> And how could I make it step through algorithms without having a more
> complicated code? Maybe usin
In <[EMAIL PROTECTED]>, andrea wrote:
> But I have some design doubts, I'd like to keep the algorithm (for
> example bfs) as clean as possible, being independent from the drawing
> methods.
> And how could I make it step through algorithms without having a more
> complicated code? Maybe using thre
On 8 Mag, 13:02, "Diez B. Roggisch" <[EMAIL PROTECTED]> wrote:
> > Well then I wanted to draw graphs and I found that pydot is working
> > really nicely.
> > BUT I'd like to do this, an interactive program to see ho the
> > algorithms works...
> > For example in the breath search first, every time
>
> Well then I wanted to draw graphs and I found that pydot is working
> really nicely.
> BUT I'd like to do this, an interactive program to see ho the
> algorithms works...
> For example in the breath search first, every time the algorithm
> colors a node, the program should redraw the graphs. W
I'm studying some graphs algorithm (minumum spanning tree, breath
search first topological sort etc etc...) and to understand better the
theory I'm implementing them with python...
I made my own graph class, the constructor is simply this:
class graph:
"in forma di matrice e' una matrice n
11 matches
Mail list logo
