aboutsummaryrefslogtreecommitdiff
blob: 44617945bf7e8aad7440868827775b838ab6285b (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
<pkgmetadata>
	<herd>sci</herd>
	<longdescription>
		It provides an easy-to-use graph data structure together with several
		operations and algorithms over graphs, in Graph.Pack. It is a reasonably
		efficient imperative data structure for directed graphs with vertices
		and edges labeled with integers. Several other graph implementations
		are proposed for those not satisfied with the one above. Some are
		persistent (imutable) and other imperative  (mutable). Some are directed
		and other are not. Some have labels for vertices, or labels for edges,
		or both. Some have abstract types for vertices. etc. These
		implementations are written as functors: you give the types of vertices
		labels, edge labels, etc. and you get the data structure as a result.
		it also provides several classic operations and algorithms over graphs.
		They are also written as functors i.e. independently of the data
		structure for graphs. One consequence is that you can define your own
		data structure for graphs and yet re-use all the algorithms from this
		library: you only need to provide a few operations such as iterating
		over all vertices, over the successors of a vertex, etc.
	</longdescription>
	<maintainer>
  		<email>sci@gentoo.org</email>
	</maintainer>
</pkgmetadata>