find all possible path between 2 nodes in an un-directed graph with preventing duplicate nodes.

Hi, I'm very new to MATLAB and am having some trouble. this is my graph below :

s = [1 1 1 1 5 5 4 4 3 3 2 6 6 7 7 8 8 9 13 13 12 12 11 11 11 10 14 14 15 15 15 16 16 17 21 21 20 20 19 19 19 18 22 23 24];

d = [5 4 3 2 6 7 7 3 8 2 9 13 7 8 12 9 11 10 14 12 15 11 16 10 17 17 21 15 20 16 19 19 17 18 22 20 23 22 23 24 18 25 25 25 25];

names = {'A' 'E' 'D' 'C' 'B' 'I' 'H' 'G' 'F' 'M' 'L' 'K' 'J' 'Q' 'P' 'O' 'N' 'U' 'T' 'S' 'R' 'X' 'W' 'V' 'Y'};

w = [8 5 2 6 6 5 3 2 5 2 5 5 3 3 4 3 6 6 8 5 7 4 8 3 7 8 10 4 7 9 6 5 9 6 4 1 9 5 9 9 1 13 12 8 7];

G = graph(s,d,w,names);

G.Edges

plot(G);

i want 2 find all possible path from this graph. like if user will give input as source = 1 and destination = 25 then in between 1-25 all possible path have to show with preventing duplicate nodes. Please, Can anyone help me?

[KSSV]

G = graph(s,d,w,names); What is this function?

[Supriya Pradhan]

actually i dont know, for drawing graph i take help from mathworks.com https://in.mathworks.com/help/matlab/ref/graph.html

Edge List Graph Construction with Node Names and Edge Weights Create and plot a cube graph using a list of the end nodes of each edge. Specify node names and edge weights as separate inputs.

s = [1 1 1 2 2 3 3 4 5 5 6 7];

t = [2 4 8 3 7 4 6 5 6 8 7 8];

weights = [10 10 1 10 1 10 1 1 12 12 12 12];

names = {'A' 'B' 'C' 'D' 'E' 'F' 'G' 'H'};

G = graph(s,t,weights,names)

G = graph with properties:

    Edges: [12×2 table]
    Nodes: [8×1 table]

[Supriya Pradhan]

this function "G = graph(s,d,w,names);" is for G = graph with properties:

    Edges: [12×2 table]
    Nodes: [8×1 table]