write_edgelist(G, path, comments='#', delimiter=' ', data=True, encoding='utf-8')
A NetworkX bipartite graph
File or filename to write. If a file is provided, it must be opened in 'wb' mode. Filenames ending in .gz or .bz2 will be compressed.
The character used to indicate the start of a comment
The string used to separate values. The default is whitespace.
If False write no edge data. If True write a string representation of the edge data dictionary.. If a list (or other iterable) is provided, write the keys specified in the list.
Specify which encoding to use when writing file.
Write a bipartite graph as a list of edges.
>>> G = nx.path_graph(4)
... G.add_nodes_from([0, 2], bipartite=0)
... G.add_nodes_from([1, 3], bipartite=1)
... nx.write_edgelist(G, "test.edgelist")
... fh = open("test.edgelist", "wb")
... nx.write_edgelist(G, fh)
... nx.write_edgelist(G, "test.edgelist.gz")
... nx.write_edgelist(G, "test.edgelist.gz", data=False)
>>> G = nx.Graph()See :
... G.add_edge(1, 2, weight=7, color="red")
... nx.write_edgelist(G, "test.edgelist", data=False)
... nx.write_edgelist(G, "test.edgelist", data=["color"])
... nx.write_edgelist(G, "test.edgelist", data=["color", "weight"])
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.bipartite.edgelist.write_edgelist
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them