| Did you know ... | Search Documentation: |
 | Pack pac -- prolog/zdd/path-count-by-mate-frontier.pl |
- HOME
- DOWNLOAD
- DOCUMENTATION
- TUTORIALS
- Beginner▶
- Advanced▶
- Web applications▶
- Semantic web▶
- Graphics▶
- Machine learning▶
- External collections▶
- For packagers▶
- COMMUNITY
- COMMERCIAL
- WIKI
- udg_path_count(+A, +B, +Ls, -C, +S) is det
- C is unified with the number of paths which connects A and B in a given undirected graph Ls in the form of a list of unordered links. Working zdd state S is fetched, and if it is not yet opened, S is unified with new state. This is all done by fetch_state/1.
- udg_path_count(+A, +B, +Ls, -C) is det
- This is almost alias of
udg_path_count(A, B, Ls, C, S), preparing S byfetch_state(S)to use this udg_path_count/4 as a zdd command.