It seems to me that the recent debate on immutable strings is misplaced. It seems related to the fact that:

• strings are not duplicated for efficiency reasons.
• since strings are mutable, it creates more aliasing than what we would care to have.

I was truly thrilled when I first came across exceptions in C++ after using the clumsy error reporting style of C. It made my algorithms cleaner and, therefore, it made me happy. After several years, I tried Java and I found it interesting to impose the discipline of explicitly declaring the exceptions that may be raised in a routine.

I just made a first submission of code in a branch of Eagle's svn repository, on origo. It covers a basic graph inheritance hierarchy with an adjacency list implementation of directed graphs. There is no room yet for weighted edges or labeled edges. It also includes preorder and postorder search cursors.

I finally decided: the project is called Eagle. The meaning of the letters is not final but initially I thought of Eiffel Algorithmic Graph Library Experiment since, in the context of the project, I'm experimenting model driven development in Eiffel with ESpec.

I just watched the Aspect Oriented Programming presentation that Martin Seiler posted recently and I remembered how interested I was about this new paradigm a year ago. Then, I look at it again and wonder what its true value is.

Looking for a name, I told myself that looking for differences and originalities could help find qualifiers for the library name since GraphLibrary seems a little naked. I thought that marking especially differences from the EiffelGraph library would help distinguish them.

NOTE: this entry has already been put in a comment about my first one on the subject but I've been pointed out that it's a poor usage of comments. Don't be surprised if it looks familiar to some of you. The next one will be a copy and paste too without this notice.

Hi everybody!

I'm currently building an experimental library to deal with graphs. Its main features are:

• It's general;
• It provides a flexible adjacency list implementation for both directed and non-directed graphs;
• The specifications of the classes are precise (they expressed as mathematical models using the EiffelSpec library);