nsl.tools.add_undirected_edges
Stay organized with collections
Save and categorize content based on your preferences.
Makes all edges of the given graph bi-directional.
nsl.tools.add_undirected_edges(
graph
)
Updates graph to include a reversed version of each of its edges. Multiple
edges between the same source and target node IDs are combined by picking the
edge with the largest weight.
Args |
|---|
graph
|
A dict: source -> (target -> weight) as returned by the
read_tsv_graph function.
|
Returns |
|---|
None. Instead, this function has a side-effect on the graph argument.
|
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2022-10-28 UTC.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2022-10-28 UTC."],[],[]]
View source on GitHub