projects: update some short descriptions

[nit.git] / lib / a_star.nit

diff --git a/lib/a_star.nit b/lib/a_star.nit
index a0b1b48..ba6b45e 100644 (file)
--- a/lib/a_star.nit
+++ b/lib/a_star.nit
@@ -211,7 +211,7 @@ end
 
 # Link between two nodes and associated to a graph
 class Link
-       auto_serializable
+       serialize
 
        # Type of the nodes in `graph`
        type N: Node
@@ -287,7 +287,7 @@ end
 
 # Result from path finding and a walkable path
 class AStarPath[N]
-       auto_serializable
+       serialize
 
        # Total cost of this path
        var total_cost: Int
@@ -316,8 +316,8 @@ class AStarPath[N]
 end
 
 # Context related to an evocation of pathfinding
-class PathContext
-       auto_serializable
+abstract class PathContext
+       serialize
 
        # Type of the nodes in `graph`
        type N: Node
@@ -352,7 +352,7 @@ end
 # Warning: A* is not optimize for such a case
 class ConstantPathContext
        super PathContext
-       auto_serializable
+       serialize
 
        redef fun worst_cost do return 1
        redef fun cost(l) do return 1
@@ -364,7 +364,7 @@ end
 # A `PathContext` for graphs with `WeightedLink`
 class WeightedPathContext
        super PathContext
-       auto_serializable
+       serialize
 
        redef type L: WeightedLink
 
@@ -393,15 +393,15 @@ end
 # A `Link` with a `weight`
 class WeightedLink
        super Link
-       auto_serializable
+       serialize
 
        # The `weight`, or cost, of this link
        var weight: Int
 end
 
 # Advanced path conditions with customizable accept states
-class TargetCondition[N: Node]
-       auto_serializable
+abstract class TargetCondition[N: Node]
+       serialize
 
        # Should the pathfinding accept `node` as a goal?
        fun accept(node: N): Bool is abstract