package = "luagraphs"
version = "1.0-1"
source = {
   url = "git://github.com/chen0040/lua-graph.git",
   tag = "v1.0.1",
}
description = {
   summary = "Lua Graph Algorithms Library",
   detailed = [[
      Lua implementation for algorithms and data structures
      for Graph processing
   ]],
   homepage = "https://github.com/chen0040/lua-graph",
   license = "MIT/X11"
}
dependencies = {
   "lua >= 5.1, < 5.4"
}
build = {
   type = "builtin",
   modules = {
      -- Note the required Lua syntax when listing submodules as keys
      ["luagraphs.data.stack"] = "src/data/stack.lua",
      ["luagraphs.data.graph"] = "src/data/graph.lua",
      ["luagraphs.data.list"] = "src/data/list.lua",
      ["luagraphs.data.queue"] = "src/data/queue.lua",
      ["luagraphs.data.UnionFind"] = "src/data/UnionFind.lua",
      ["luagraphs.data.MinPQ"] = "src/data/MinPQ.lua",
      ["luagraphs.data.IndexedMinPQ"] = "src/data/IndexedMinPQ.lua",
      ["luagraphs.search.DepthFirstSearch"] = "src/search/DepthFirstSearch.lua",
      ["luagraphs.search.BreadthFirstSearch"] = "src/search/BreadthFirstSearch.lua",
      ["luagraphs.sort.TopologicalSort"] = "src/sort/TopologicalSort.lua",
      ["luagraphs.connectivity.ConnectedComponents"] = "src/connectivity/ConnectedComponents",
      ["luagraphs.connectivity.StronglyConnectedComponents"] = "src/connectivity/StronglyConnectedComponents",
      ["luagraphs.mst.KruskalMST"] = "src/mst/KruskalMST",
      ["luagraphs.mst.PrimMST"] = "src/mst/PrimMST",
      ["luagraphs.mst.EagerPrimMST"] = "src/mst/EagerPrimMST",
      ["luagraphs.shortest_paths.Dijkstra"] = "src/shortest_paths/Dijkstra",
   }
}