Hello,
I implemented a DirectedWeightedGraph
along with the corresponding Dijkstra
and wanted to know whether the main developers
are interested in integrating it.
Furthermore I have some general questions?
Was performance an issue when developing the
GraphImpl and the algorithms?
Why is there no getEdges() and getEdgeCount() in
Graph?
Is there a need for further algorithms (I'm thinking
of changing my graph algorithms in order to
work with openjgraph)?
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
If you send me the code, I will review and commit it. Since there's already a DirectedWeightedEdge, there should be a DirectedWeightedGraph as well.
Some of my changes that went into 0.9.2 were intended to improve performance. If you're using an older version, you might want to upgrade, since there were lots of data structure changes.
Also in 0.9.2, the Graph interface now provides methods getEdgesCount() and getEdgeSet().
Contribution of more algorithms would be great.
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
I just added the code as a patch in the patches
section because someone asked for it.
But I think I will stop using this framework,
because it has not enough performance. If
I need to reimplement all methods in order to meet
my timing requirements I will write my own
from scratch. I think, the main problem is
that the data is "over-encapsulated". Is there really
a need for storing all the vertices twice in a
directed edge (once in the edge, once in the
delegate) or to have a delegate just for storing
the weight. I am a fan of OOP as well but I
think this was not the goal when the
Design Patterns were wrote.
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Hello,
I implemented a DirectedWeightedGraph
along with the corresponding Dijkstra
and wanted to know whether the main developers
are interested in integrating it.
Furthermore I have some general questions?
Was performance an issue when developing the
GraphImpl and the algorithms?
Why is there no getEdges() and getEdgeCount() in
Graph?
Is there a need for further algorithms (I'm thinking
of changing my graph algorithms in order to
work with openjgraph)?
If you send me the code, I will review and commit it. Since there's already a DirectedWeightedEdge, there should be a DirectedWeightedGraph as well.
Some of my changes that went into 0.9.2 were intended to improve performance. If you're using an older version, you might want to upgrade, since there were lots of data structure changes.
Also in 0.9.2, the Graph interface now provides methods getEdgesCount() and getEdgeSet().
Contribution of more algorithms would be great.
I just added the code as a patch in the patches
section because someone asked for it.
But I think I will stop using this framework,
because it has not enough performance. If
I need to reimplement all methods in order to meet
my timing requirements I will write my own
from scratch. I think, the main problem is
that the data is "over-encapsulated". Is there really
a need for storing all the vertices twice in a
directed edge (once in the edge, once in the
delegate) or to have a delegate just for storing
the weight. I am a fan of OOP as well but I
think this was not the goal when the
Design Patterns were wrote.