Can I create a DAG in newlisp

[csfreebird]

Hi, My task is to create a directed acyclic graph, I want to implement it using list.
Can any one make an example for me?
My simple case looks like:
[img]1.png[/img]

A and B are start nodes. Each node has properities, each edge has properties too.
E, G and F are end nodes.

I also need a way to find all dependencies of one node.e.g.
If input is D, its dependencies are A, B and C.

[johu]

[rickyboy]

[rickyboy]

Here's another attachment of code. This contains the code from the previous post with a few additions. Everything you can do with parents and ancestors ("deep parents") in the former code, you can now do with children and descendants ("deep children") also. I also added some comments showing example usages of a few of the intermediate functions (including a couple of degenerate cases, but not exhaustive).

Please try improving it for performance or adding new functionality, for instance, there is no DAG validation (e.g. checking for cycles or making sure a Node exists when it's mentioned by name in an Edge); there is no shortest path function, etc. yet.

Happy hacking!

[csfreebird]

Thank yuu, johu. Your example is simple enough to understand.
Thank you rickyboy, you are so fast, I will learn your code carefully.