write a Prolog Program which describes a directed graph (G) (shown below)

A) write all possible node and edge facts that describes the structure of this graph G such as below:

node( a ). % a is a node of this graph.

edge( a, b ). % There is an edge (directed) from node a to b.

B) complete the definition all these rules.

node(X) :- % X is a node in graph G

edge( X, Y) :- % There is an directed edge from X to Y.

parent( X, Y) :- % There is a directed edge from X to Y.

child(X, Y) :- % Y is parent of X.

path( X, Y) :- % find a directed path from node X to node Y.

length_of_path( X, Y):- % Length of a path (directed) from X to Y.

connected( X, Y):- % There is a directed path from X to Y, or from Y to X

undirected_edge( X, Y) :- /* There is an edge (ignoring the directions) from X to Y or from Y to X */

undirected_path( X, Y) :- /* find a path (ignoring the directions) from node X to node Y. */

This is what I have

node(a). node(b). node(c). node(d). node(e). node(f). node(g). node(h).

edge(a,b). edge(b,c). edge(c,a). edge(c,e). edge(c,d). edge(d,e). edge(d,h). edge(e,f). edge(e,g). edge(f,g). edge(g,e).

node(X):- node(X).

edge(X,Y):- node(X),node(Y),edge(X,Y).

parent(X,Y):- node(X),node(Y), edge(X,Y).

child(X,Y):- node(X), node(Y), edge(Y,X).

Not sure if what I wrote is correct and not sure how to continue the other rules.

e a C