time_measure.h went to src/include.

Minor doc corrections

Some more tests.

Some more docs.
Put it into the 'misc' group.

'misc' group added to the documentation

misc

macro erase

For working with undirected graphs, head is changed to aNode.
Some dimacs doki.

leda comparison files

comparison with leda algorithms, wrapper for leda graphs

misc

Better control of gcc version

typo

for igcc-3.4.0

gcc-3.4.0

misc

To be on the safe side...

misc

as you see...

stGraphWrapper is almost working

Some more docs.

The doc modules clearly needs some restructuring...

Docs are now divided into modules.

#define HUGO_SMART_GRAPH_H ---> #define HUGO_LIST_GRAPH_H

More docs.

Try to compile before commit, please.

A missing conversion added

Some bugfixes.
Some more docs.

class NodeSet: A graph class with no edges
class EdgeSet: A graph class using the node set of another graph.
It compiles but untested and undocumented.

The diffs in src/include/smart_graph.h between 528:529 was merged into
this file.

A (non)bug was fixed.
Some more docs in SymSmartGraph.

I hope it works. The 'erase' functions hasn't been tested yet.

Some day this file will contain an erasable version of SmartGraph.

For the future "node_set" and "edge_set" structures.

New union-find structure with enumerable classes.

misc

g++-4.0

StdMap compiles with 3.4

jacint mindig modosit, es ezert nekunk is kell

modifications for better compatibility with gcc 3.4.0

ResGraphWrapper running time comparison test.

Documentation added.

aprosag

Some changes in the documentation.

Testfile for dijkstra.h, bin_heap.h and fib_heap.h

3.4.0-asban megszuntettek a bug-ot.
Egyaltalan nem hagyta leforditani a file-t, ha nem irtunk elet "typename" es
"template" kulcsszot.
Azota viszont mar a 3.3-as is gond nelkul forditja.

(none)

misc

.

.

(none)

(none)

preflow mods

(none)

(none)

Changes in the documentation.

(none)

misc

(none)

Directed path structure.
Proposal for a path building interface.

experimental bipartite graph wrapper

Remove function and some todos.

Test for the new style iter

Masikfele iteralas, Node-hoz alkalmazkodva...

dimacs.hh goes to oldies

Idezni csak pontosan, szepen, ahogy a csiga...

IterableMap: no range checking, no warning :)

IterableMap with template ValueType. IterableBoolMap as a specialization.
Range checking warnings...

work/marci/bfs_iterator.h BfsIterator5 -> BfsIterator, DfsIterator5 -> DfsIterator

misc

time comparison for bfs iterator and iterator by hand

Requests for docs.

.

Folder for the test programs.

UndirListGraph, somebody should try it.

template first goes to comment...

A successful work-around for using const map reference as an output
parameter to Kruskal().

NullMap

Maximum Adjacency Ordering (beta)

Kruskal lenyegeben kesz.
Kell meg dokumentalni, meg meg egy par jol hasznalhato wrapper fv.
Es valamit meg kene csinalni azzal, hogy nem const ref. a kimeno boolmap,
viszont sokszor "on-the-fly" akarjuk megkonstrualni (es ilyenkor persze a
const-os mapet is lehet set-elni...)

A bool Edge Map with iterators that goes through the true or the false edges.

A generic map with value type [0, N) where N is a small integer.
Can enumerate keys with a given value.

megsem volt bug

Misterious bug with StdMap::set (?)
Fixed default contstructor.

Some cosmetic changes and spell checking.

time_measure.h has been added to the doc.
graph_concept.h has been removed for it was confusing.

An example for a readable/writeable but non-referrable map
without get() and set().

semmi

(none)

graph_wrapper.h, kicsi doksi. erdekes dolgokat rak az abrakadabra, nem is ertem

kicsit takaritottam, es szepitettem es, es maga a csuda, de azer nem
teljesen mer' meg kell csinalni vele dolgokat.

(none)

(none)

jflsjfljskf

brrr

makroizeles