Hello everyone, I have a task in which I need to store in an array all possible paths between two nodes, in this case, from the inicial node to the last one.
I'm trying to start but I have no ideas on how to.
I'll be using a matrix, I got all my adjacent vertex's stored in an Adjacency List and I coded a function that passes my Adjacency List to a matrix so I'll be using it.
Any ideas on how I could start ?
Maybe Dijkstra ?
Making it so that when I pass through each vertex, I have a flag storing it as 1 or 0, being 1 when he's visited and 0 when he hasn't been visited yet.