Commits · a253ca559cc2d40ab90909cd3f37bc53ef317f33 · Algorithms Library Toolkit / Algorithms Library Toolkit Core

Apr 21, 2015
- use emplace while working with Token deque · a253ca55
  Jan Trávníček authored 9 years ago
  
  a253ca55
- move when popping from Token deque · 11a44f3a
  Jan Trávníček authored 9 years ago
  
  11a44f3a
Apr 19, 2015
- check token order when composing in DEBUG only · fe962079
  Jan Trávníček authored 9 years ago
  
  fe962079
- change std::list to std::deque · b8138683
  Jan Trávníček authored 9 years ago
  
  b8138683
- speedup parsing stdin and composing to stdout · 0339d394
  Jan Trávníček authored 9 years ago
  
  0339d394
Apr 17, 2015
- add std::move to all parsers · d6da4a44
  Jan Trávníček authored 9 years ago
  
  d6da4a44
- implement more efficient triming algo · b08f8211
  Jan Trávníček authored 9 years ago
  
  b08f8211
Apr 16, 2015
- refactor · 842e5da7
  Jan Trávníček authored 9 years ago
  
  842e5da7
Apr 15, 2015
- + efficient implementation of epsilon remove algos · c5e8de64
  Jan Trávníček authored 9 years ago
  
  c5e8de64
Apr 12, 2015
- fix formal regexp optimize · ea7152b5
  Jan Trávníček authored 9 years ago
  
  ea7152b5
- resolve unused parameters warning · c2c1587c
  Jan Trávníček authored 9 years ago
  
  c2c1587c
- finish integration and derivation tests · 419e9c91
  Jan Trávníček authored 9 years ago
  
  419e9c91
Apr 10, 2015
- use path to select up to single class of test · 123eb257
  Jan Trávníček authored 9 years ago
  
  123eb257
- make operator std::string explicit · 8de2be73
  Jan Trávníček authored 9 years ago
  
  8de2be73
Apr 09, 2015
- Implement multi nfa subsequence automaton · ad8f7bdd
  Jan Trávníček authored 9 years ago
  
  ad8f7bdd
Apr 08, 2015
- exact subsequence automata construction algorithms · f53f1136
  Jan Trávníček authored 9 years ago
  
  f53f1136
- renaming · f421fe05
  Jan Trávníček authored 9 years ago
  
  f421fe05
Apr 07, 2015
- exact matching automaton · f040439a
  Jan Trávníček authored 9 years ago
  
  f040439a
Apr 06, 2015
- run only test group with path prefix · 1bc3909d
  Jan Trávníček authored 9 years ago
  
  1bc3909d
Mar 24, 2015
- Merge branch 'graphs' · 56b9d1d6
  Jan Trávníček authored 10 years ago
  
  56b9d1d6
Mar 23, 2015
- Graph: compare by node/edge values + output to xml/string · 59a2c48c
  David Rosca authored 10 years ago
  
  View commits for tag BP-roscadav BP-roscadav
  
  59a2c48c
Mar 22, 2015
- refactor, rename for all deterministic pdas · 30b36274
  Jan Trávníček authored 10 years ago
  
  30b36274
- std/compare.hpp: Fix compare for unordered_map · 03169212
  David Rosca authored 10 years ago
  
  unordered_map is unordered (O.o) so it cannot be compared by two simultaneous iterators
  03169212
- Graph spanningtree algo: Add JarnikPrim · ab3b6dad
  David Rosca authored 10 years ago
  
  ab3b6dad
- AdjacencyList representation: fix compare · 3a475616
  David Rosca authored 10 years ago
  
  3a475616
- UndirectedEdge: Fix compare and hash for Edge(n1, n2) - Edge(n2, n1) · d6a2ab3e
  David Rosca authored 10 years ago
  
  d6a2ab3e
- Graph test: Add GraphElementsTest · 87b9cb3d
  David Rosca authored 10 years ago
  
  87b9cb3d
- Graph: Add hasNode/hasEdge methods + tests · 7c3e7097
  David Rosca authored 10 years ago
  
  7c3e7097
Mar 21, 2015
- Topological sort: Remove function for Undirected Graph · 89caa89e
  David Rosca authored 10 years ago
  
  + fix unused variables warning
  89caa89e
- Graph sort algo: Add TopologicalSort · 21795733
  David Rosca authored 10 years ago
  
  21795733
Mar 09, 2015
- DFS: Change second variant to also offer canceling of traversal · 9eaa71f9
  David Rosca authored 10 years ago
  
  9eaa71f9
- Graph shortestpath algo: Add Floyd-Warshall algorithm + tests · 5cd6cfc0
  David Rosca authored 10 years ago
  
  5cd6cfc0
- Directed graph: Fixed adding nodes when adding edge · 83010cfb
  David Rosca authored 10 years ago
  
  + added tests
  83010cfb
Mar 08, 2015
- Graph shortestpath algo: Add Bellman-Ford algorithm + tests · f54c569a
  David Rosca authored 10 years ago
  
  f54c569a
- Graph shortestpath algo: Add Dijkstra algorithm + tests · 78cf2258
  David Rosca authored 10 years ago
  
  78cf2258
- Graphs: Change node/edge values from Primitive to int · d7cbbca9
  David Rosca authored 10 years ago
  
  Primitive doesn't work well in algorithms. Also, almost (?) all algorithms are working with integer values on nodes/edges, so this should be just fine.
  d7cbbca9
- Merge branch 'master' into graphs · d88b39d5
  David Rosca authored 10 years ago
  
  d88b39d5
- BFS, DFS: Use typedefs for std::function signatures · a5b0300c
  David Rosca authored 10 years ago
  
  a5b0300c
- DFS: Add version returning predecessors and opening/closing times · 894d95fc
  David Rosca authored 10 years ago
  
  Also simplify lambdas in tests to capture everything
  894d95fc
- BFS: Add version returning predecessor and distance for each node · 85a2933b
  David Rosca authored 10 years ago
  
  Also simplify lambdas in tests to capture everything
  85a2933b

Admin message