forked from jdleesmiller/gratr
-
Notifications
You must be signed in to change notification settings - Fork 0
/
gratr.gemspec
66 lines (53 loc) · 1.76 KB
/
gratr.gemspec
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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
# -*- encoding: utf-8 -*-
lib = File.expand_path('../lib/', __FILE__)
$:.unshift lib unless $:.include?(lib)
require 'gratr/version'
Gem::Specification.new do |s|
#### Basic information.
s.name = 'gratr'
s.version = GRATR::VERSION
s.summary = "Graph Theory Ruby library"
s.description = <<-EOF
GRATR is a framework for graph data structures and algorithms.
This library is a fork of RGL. This version utilizes
Ruby blocks and duck typing to greatly simplfy the code. It also supports
export to DOT format for display as graphics.
GRATR currently contains a core set of algorithm patterns:
* Breadth First Search
* Depth First Search
* A* Search
* Floyd-Warshall
* Best First Search
* Djikstra's Algorithm
* Lexicographic Search
The algorithm patterns by themselves do not compute any meaningful quantities
over graphs, they are merely building blocks for constructing graph
algorithms. The graph algorithms in GRATR currently include:
* Topological Sort
* Strongly Connected Components
* Transitive Closure
* Rural Chinese Postman
* Biconnected
EOF
#### Which files are to be included in this gem? Everything!
#(Except CVS directories.)
s.files = Dir[
'install.rb',
'README',
'lib/**/*.rb',
'tests/**/*.rb',
'examples/**/*'].to_a
#### Load-time details: library and application (you will need one or both).
s.require_path = 'lib' # Use these for libraries.
#### Documentation and testing.
s.extra_rdoc_files = ['README']
s.rdoc_options <<
'--title' << 'GRATR - Ruby Graph Library' <<
'--main' << 'README' <<
'--line-numbers'
#### Author and project details.
s.author = "Shawn Garbett"
s.email = "[email protected]"
s.homepage = "http://gratr.rubyforge.org"
s.rubyforge_project = "gratr"
end