Rubygems | Latest Versions for rglhttps://rubygems.org/gems2020-12-19T21:40:10Zrgl (0.5.7)https://rubygems.org/gems/rgl/versions/0.5.72020-12-19T21:40:10ZHorst Duchene, Kirill LashukRuby Graph Library
RGL is a framework for graph data structures and algorithms rgl (0.5.6)https://rubygems.org/gems/rgl/versions/0.5.62019-08-23T20:35:32ZHorst Duchene, Kirill LashukRuby Graph Library
RGL is a framework for graph data structures and algorithms rgl (0.5.5)https://rubygems.org/gems/rgl/versions/0.5.52019-08-23T19:33:17ZHorst Duchene, Kirill LashukRuby Graph Library
RGL is a framework for graph data structures and algorithms rgl (0.5.4)https://rubygems.org/gems/rgl/versions/0.5.42019-02-06T21:09:11ZHorst Duchene, Kirill LashukRuby Graph Library
RGL is a framework for graph data structures and algorithms rgl (0.5.3)https://rubygems.org/gems/rgl/versions/0.5.32017-04-22T21:02:24ZHorst Duchene, Kirill LashukRuby Graph Library
RGL is a framework for graph data structures and algorithms rgl (0.5.2)https://rubygems.org/gems/rgl/versions/0.5.22016-05-09T22:24:37ZHorst Duchene, Kirill LashukRuby Graph Library
RGL is a framework for graph data structures and algorithms rgl (0.5.1)https://rubygems.org/gems/rgl/versions/0.5.12015-07-25T17:37:17ZHorst Duchene, Kirill LashukRuby Graph Library
RGL is a framework for graph data structures and algorithms rgl (0.5.0)https://rubygems.org/gems/rgl/versions/0.5.02014-12-15T20:36:18ZHorst Duchene, Kirill LashukRuby Graph Library
RGL is a framework for graph data structures and algorithms rgl (0.4.0)https://rubygems.org/gems/rgl/versions/0.4.02009-07-25T17:59:21ZHorst DucheneRuby Graph Library
RGL is a framework for graph data structures and algorithms. The design of the library is much influenced by the Boost Graph Library (BGL) which is written in C++ heavily using its template mechanism. RGL currently contains a core set of algorithm patterns: * Breadth First Search * Depth First 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 RGL currently include: * Topological Sort * Connected Components * Strongly Connected Components * Transitive Closure * Transitive Reduction * Graph Condensation * Search cycles (contributed by Shawn Garbett) rgl (0.3.1)https://rubygems.org/gems/rgl/versions/0.3.12009-07-25T17:59:21ZHorst DucheneRuby Graph Library
RGL is a framework for graph data structures and algorithms. The design of the library is much influenced by the Boost Graph Library (BGL) which is written in C++ heavily using its template mechanism. RGL currently contains a core set of algorithm patterns: * Breadth First Search * Depth First 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 RGL currently include: * Topological Sort * Connected Components * Strongly Connected Components * Transitive Closure * Search cycles (contributed by Shawn Garbett) rgl (0.3.0)https://rubygems.org/gems/rgl/versions/0.3.02009-07-25T17:59:21ZHorst DucheneRuby Graph Library
RGL is a framework for graph data structures and algorithms. The design of the library is much influenced by the Boost Graph Library (BGL) which is written in C++ heavily using its template mechanism. RGL currently contains a core set of algorithm patterns: * Breadth First Search * Depth First 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 RGL currently include: * Topological Sort * Connected Components * Strongly Connected Components * Transitive Closure * Search cycles (contributed by Shawn Garbett) rgl (0.2.3)https://rubygems.org/gems/rgl/versions/0.2.32009-07-25T17:59:21ZHorst DucheneRuby Graph Library
RGL is a framework for graph data structures and algorithms. The design of the library is much influenced by the Boost Graph Library (BGL) which is written in C++ heavily using its template mechanism. RGL currently contains a core set of algorithm patterns: * Breadth First Search * Depth First 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 RGL currently include: * Topological Sort * Connected Components * Strongly Connected Components * Transitive Closure rgl (0.2.2)https://rubygems.org/gems/rgl/versions/0.2.22009-07-25T17:59:22ZHorst DucheneRuby Graph Library
RGL is a framework for graph data structures and algorithms. The design of the library is much influenced by the Boost Graph Library (BGL) which is written in C++ heavily using its template mechanism. RGL currently contains a core set of algorithm patterns: * Breadth First Search * Depth First 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 RGL currently include: * Topological Sort * Connected Components * Strongly Connected Components * Transitive Closure