Python: Networkx get path between given two nodes with nodes and edges

Question

Is there any function to get the list of all paths which will consist of nodes and the edges between any two given nodes from a graph?

Functions like dijkstra_path() and shortest_path() etc return only nodes.

Answer 1

I think you're looking for the get_edge_data() function. Check the page for examples how to use it.