FaronBracy
FaronBracy
The map generation in RogueSharp is very generic and not suitable for creating maps for real games. They were meant to be more of an example that could be expanded...
Instead of calling Map.SetCellProperties( x, y, isTransparent, isWalkable, isExplored) have 3 simple methods for setting these properties. `Map.SetIsTransparent(x,y,true);` `Map.SetIsWalkable(x,y,true);` `Map.SetIsExplored(x,y,true);`
If the Map class had a custom indexer it would allow us to call Map[X,Y] to get a cell at an X,Y coordinate. I have received feedback that this would...
**Example** - The {color} door is made of {material}. - This corridor smells like {smell}. It has {feature} along the walls. https://en.wikipedia.org/wiki/Mad_Libs
https://en.wikipedia.org/wiki/A*_search_algorithm This should perform better than the current Dijkstra algorithm.
RogueSharp currently multi-targets .NET Standard 1.0 and .NET Framework 4.0. Consider bumping this up to .NET Standard 2.0. **Pros** - Additional features available to make development more pleasant - Unity...
DijkstraShortestPath.PathTo method returns an IEnumerable and could yield return DirectedEdge. https://github.com/FaronBracy/RogueSharp/blob/master/RogueSharp/Algorithms/DijkstraShortestPath.cs#L130 Currently it does not, yet many other methods in the solution that return IEnumerable do. https://github.com/FaronBracy/RogueSharp/blob/master/RogueSharp/Map.cs#L293 Investigate which approach...
The DijkstraShortestPath class has a Check method that is currently only used by unit tests. https://github.com/FaronBracy/RogueSharp/blob/master/RogueSharp/Algorithms/DijkstraShortestPath.cs#L153 It was originally intended to be a private method and called from the bottom...
The DepthFirstPaths class has a PathTo method that returns a list of vertices from source to destination https://github.com/FaronBracy/RogueSharp/blob/master/RogueSharp/PathFinder.cs#L100 The source vertex is not included in the list. This behavior is...