search

takemaru / graphillion

Fast, lightweight graphset operation library
Other
466 stars 40 forks source link

DAG #29

Closed hotpeperoncino closed 6 years ago

hotpeperoncino commented 7 years ago

I'd like to use one way direction edge in graph in case of finding all pathes. Probably as default behavior, this library computes on bidirectional graph. when some edges have only one direction, how to support them in program ? can I have your advice?

takemaru commented 7 years ago

As you guessed, Graphillion currently supports undirected graphs only. If you only want to enumerate/count paths in a directed graph, you can use the following implementation:

https://github.com/junkawahara/frontier

Best regards,

hotpeperoncino commented 7 years ago

Thank you for your reply and information. I want to do intersection operation between several results. I'd like to investigate the introduced library, thanks.

ghost commented 4 years ago

I have the same issue @hotpeperoncino (i.e., finding all paths). Did you find the aforementioned lib useful? Or direct me to any useful resource, please. Thanks @takemaru for making the graphillion available.

takemaru commented 4 years ago

Although I haven't used the lib, the developer of the lib is one of Graphillion founders, so I believe it is useful for Graphillion users.