Skip to content

N-Prolog Ver.4.78 Release Notes

Choose a tag to compare

View all tags
@sasagawa888 sasagawa888 released this 31 Dec 01:01
v4.78
da0b6c4

N-Prolog Ver.4.78 Release Notes

Main Improvements

1. New Graph Library

N-Prolog now comes with a newly added graph library.
This release supports the following features:

  • Dijkstra's Shortest Path
    Efficiently find the shortest paths in a graph, leveraging Prolog's natural strengths in recursion and backtracking.

  • Strongly Connected Components (SCC) Decomposition
    Extract strongly connected components from any graph using a Prolog-style implementation that fully utilizes backtracking.

With this addition, N-Prolog can now handle graph analysis in a natural and intuitive way, extending beyond traditional list-based operations.

2. Improved Error Reporting

  • When loading code with consult or reconsult, syntax errors along with their line and column positions are now displayed.
  • This makes it easier to pinpoint exactly where an error occurs in your code.

3. Module Loading Fix

  • Fixed an issue where error position information was not correctly displayed when using use_module.

4. Bug Reporting

  • There may still be some unnoticed bugs in this release.
    If you find any, please let us know.

With these improvements, Prolog-style graph analysis becomes more intuitive and practical, opening up new possibilities for learning, experimentation, and development.
We look forward to further enhancing N-Prolog in future releases based on your feedback.

Assets 2
Loading