algolib

Contact owners and managers

1–12 of 12

This is a discussion group for the algolib open-source project. Algolib is a library of useful data structures and algorithms. It was originally created as an educational vehicle, for demonstrating various advanced data structures and algorithms. This project seeks to improve the quality of the code and make it more useful for application developers.

To go to the project web site, click here.

0 selected

Yong Fu, Turner Jonathan3

7/1/12

Wgraph and Wdigraph with graphviz output

Very cool! On Jun 30, 2012, at 7:51 PM, Yong Fu wrote: > I checked in graphviz output code of

unread,

Wgraph and Wdigraph with graphviz output

Very cool! On Jun 30, 2012, at 7:51 PM, Yong Fu wrote: > I checked in graphviz output code of

7/1/12

Yong Fu, Turner Jonathan6

6/25/12

Graph, Digraph with graphviz output

I checked in a updated version of Graph.cpp and Digraph.cpp. There is really a bug for the line

unread,

Graph, Digraph with graphviz output

I checked in a updated version of Graph.cpp and Digraph.cpp. There is really a bug for the line

6/25/12

Yong Fu, Turner Jonathan3

6/20/12

Add architecture detection in makefiles

> > This sounds like a good idea. Can you explain how? Under Linux and Mac OS, I tried the

unread,

Add architecture detection in makefiles

> > This sounds like a good idea. Can you explain how? Under Linux and Mac OS, I tried the

6/20/12

Yinfan Li, … Yong Fu4

6/20/12

I don't understand why " it is difficult to write classes that work correctly for all types

unread,

I don't understand why " it is difficult to write classes that work correctly for all types

6/20/12

Yinfan Li, Turner Jonathan2

6/8/12

duplicated header?

In general, header files should only appear in include, but there may be copies in other places.

unread,

duplicated header?

In general, header files should only appear in include, but there may be copies in other places.

6/8/12

Yinfan Li, … Turner Jonathan7

6/7/12

sort comparison

So I think we might want to use STL sort, instead of a simple heap sort. According to David R Musser

unread,

sort comparison

So I think we might want to use STL sort, instead of a simple heap sort. According to David R Musser

6/7/12

Yinfan Li, Turner Jonathan2

6/5/12

possible bug in Graph.cpp

You're quite right. I should have used the push_back method on the vector. I've fixed the bug

unread,

possible bug in Graph.cpp

You're quite right. I should have used the push_back method on the vector. I've fixed the bug

6/5/12

Turner Jonathan, Yinfan Li6

6/5/12

Releasing graphs

It works, thank you. I should bring this question a little bit earlier, so I don't need to do

unread,

Releasing graphs

It works, thank you. I should bring this question a little bit earlier, so I don't need to do

6/5/12

Yinfan Li, Turner Jonathan5

6/4/12

Why do we use heap sort in kruskal's algorithm?

I will try to implement merge sort and try to compare the two. I'll start with some naive version

unread,

Why do we use heap sort in kruskal's algorithm?

I will try to implement merge sort and try to compare the two. I'll start with some naive version

6/4/12

Yinfan Li, … Turner Jonathan13

6/4/12

A few small problems

Going to clean up the warnings. Jon

unread,

A few small problems

Going to clean up the warnings. Jon

6/4/12

Yong Fu, Turner Jonathan3

6/2/12

Simple code style guide

> 7.2 Indention > Use only space. The first indent is 8 spaces, the second one is 16 spaces,

unread,

Simple code style guide

> 7.2 Indention > Use only space. The first indent is 8 spaces, the second one is 16 spaces,

6/2/12

Jon Turner, … Yong Fu29

5/30/12

Getting organized

Sorry. I mean for whole unit test not only UiList test. Since when checking in some new code, we have

unread,

Getting organized

Sorry. I mean for whole unit test not only UiList test. Since when checking in some new code, we have

5/30/12

Search

Clear search

Close search

Google apps

Main menu