Skip to content

Commit

Permalink
updated README.md (output result added)
Browse files Browse the repository at this point in the history
  • Loading branch information
pablo.rodriguez.mier committed Dec 10, 2014
1 parent 0928aeb commit 7444359
Showing 1 changed file with 2 additions and 0 deletions.
2 changes: 2 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -123,6 +123,8 @@ SearchProblem p = GraphSearchProblem
System.out.println(Hipster.createDijkstra(p).search("F"));
```

Output result: `Total number of iterations: 7. States: [A, B, C, E, D, F], Actions: [2.0, 1.0, 3.0, 2.0, 2.0], Search information: WeightedNode{state=F, cost=10.0, estimation=0.0, score=10.0}`

But that's not all. Hipster comes with different problem examples
that illustrate how Hipster can be used to solve a [wide variety of problems](https://github.com/citiususc/hipster/tree/development/hipster-examples/src/main/java/es/usc/citius/hipster/examples) (not only graph search).

Expand Down

0 comments on commit 7444359

Please sign in to comment.