Python：Networkx获取具有节点和边的给定两个节点之间的路径
[英]Python: Networkx get path between given two nodes with nodes and edges
问题描述
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. 像功能dijkstra_path()和shortest_path()等只返回节点。
1 个解决方案
解决方案1
2 已采纳 2017-03-23 00:05:45
I think you're looking for the get_edge_data() function. 我认为您正在寻找get_edge_data（）函数。 Check the page for examples how to use it. 检查页面以获取有关如何使用它的示例。
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.
相关问题
使用 networkx 在两个节点之间绘制多条边 - Drawing multiple edges between two nodes with networkx
计算两个节点 NetworkX 之间的最长路径 - Calculate the longest path between two nodes NetworkX
networkx中的有向图结构，两个节点之间有两条边 - Directed Graph Structure in networkx with two edges between two nodes
匹配两个节点并保持其他各自节点之间的路径networkx - Match two nodes and keep the path between the other respective nodes networkx
节点之间的两条边 - Two Edges Between Nodes
查找 networkx 中每对节点之间的边 - Finding edges between each pair of nodes in networkx
Python：NetworkX查找包含给定节点列表的最短路径 - Python: NetworkX Finding shortest path which contains given list of nodes
python networkx 在某些条件下删除节点和边 - python networkx remove nodes and edges with some condition
如何根据节点之间的其他边有条件地在网络中创建边（使用 python Networkx 包）？ - How to create edges in a network conditionally (using python Networkx package) based on other edges between nodes?
如何使用NetworkX获得一组路由中两个节点之间的最短路径？ - How to get the shortest path between two nodes in a set of routes using NetworkX?
相关标签