Python networkx.read_adjlist() Examples
The following are 27
code examples of networkx.read_adjlist().
You can vote up the ones you like or vote down the ones you don't like,
and go to the original project or source file by following the links above each example.
You may also want to check out all available functions/classes of the module
networkx
, or try the search function
.
.
Example #1
| Source File: graph.py From GPF with MIT License | 5 votes |
|
def read_adjlist(self, filename):
""" Read graph from adjacency file in which the edge must be unweighted
the format of each line: v1 n1 n2 n3 ... nk
:param filename: the filename of input file
"""
self.G = nx.read_adjlist(filename, create_using=nx.DiGraph())
for i, j in self.G.edges():
self.G[i][j]['weight'] = 1.0
self.encode_node()
Example #2
| Source File: test_adjlist.py From aws-kube-codesuite with Apache License 2.0 | 5 votes |
|
def test_adjlist_delimiter(self):
fh=io.BytesIO()
G = nx.path_graph(3)
nx.write_adjlist(G, fh, delimiter=':')
fh.seek(0)
H = nx.read_adjlist(fh, nodetype=int, delimiter=':')
assert_nodes_equal(list(H), list(G))
assert_edges_equal(list(H.edges()), list(G.edges()))
Example #3
| Source File: test_adjlist.py From aws-kube-codesuite with Apache License 2.0 | 5 votes |
|
def test_adjlist_multidigraph(self):
G=self.XDG
(fd,fname)=tempfile.mkstemp()
nx.write_adjlist(G,fname)
H=nx.read_adjlist(fname,nodetype=int,
create_using=nx.MultiDiGraph())
H2=nx.read_adjlist(fname,nodetype=int,
create_using=nx.MultiDiGraph())
assert_not_equal(H,H2) # they should be different graphs
assert_nodes_equal(list(H), list(G))
assert_edges_equal(list(H.edges()), list(G.edges()))
os.close(fd)
os.unlink(fname)
Example #4
| Source File: test_adjlist.py From aws-kube-codesuite with Apache License 2.0 | 5 votes |
|
def test_adjlist_multigraph(self):
G=self.XG
(fd,fname)=tempfile.mkstemp()
nx.write_adjlist(G,fname)
H=nx.read_adjlist(fname,nodetype=int,
create_using=nx.MultiGraph())
H2=nx.read_adjlist(fname,nodetype=int,
create_using=nx.MultiGraph())
assert_not_equal(H,H2) # they should be different graphs
assert_nodes_equal(list(H), list(G))
assert_edges_equal(list(H.edges()), list(G.edges()))
os.close(fd)
os.unlink(fname)
Example #5
| Source File: test_adjlist.py From aws-kube-codesuite with Apache License 2.0 | 5 votes |
|
def test_adjlist_integers(self):
(fd,fname)=tempfile.mkstemp()
G=nx.convert_node_labels_to_integers(self.G)
nx.write_adjlist(G,fname)
H=nx.read_adjlist(fname,nodetype=int)
H2=nx.read_adjlist(fname,nodetype=int)
assert_nodes_equal(list(H), list(G))
assert_edges_equal(list(H.edges()), list(G.edges()))
os.close(fd)
os.unlink(fname)
Example #6
| Source File: test_adjlist.py From aws-kube-codesuite with Apache License 2.0 | 5 votes |
|
def test_adjlist_digraph(self):
G=self.DG
(fd,fname)=tempfile.mkstemp()
nx.write_adjlist(G,fname)
H=nx.read_adjlist(fname,create_using=nx.DiGraph())
H2=nx.read_adjlist(fname,create_using=nx.DiGraph())
assert_not_equal(H,H2) # they should be different graphs
assert_nodes_equal(list(H), list(G))
assert_edges_equal(list(H.edges()), list(G.edges()))
os.close(fd)
os.unlink(fname)
Example #7
| Source File: test_adjlist.py From aws-kube-codesuite with Apache License 2.0 | 5 votes |
|
def test_adjlist_graph(self):
G=self.G
(fd,fname)=tempfile.mkstemp()
nx.write_adjlist(G,fname)
H=nx.read_adjlist(fname)
H2=nx.read_adjlist(fname)
assert_not_equal(H,H2) # they should be different graphs
assert_nodes_equal(list(H), list(G))
assert_edges_equal(list(H.edges()), list(G.edges()))
os.close(fd)
os.unlink(fname)
Example #8
| Source File: test_adjlist.py From Carnets with BSD 3-Clause "New" or "Revised" License | 5 votes |
|
def test_adjlist_delimiter(self):
fh = io.BytesIO()
G = nx.path_graph(3)
nx.write_adjlist(G, fh, delimiter=':')
fh.seek(0)
H = nx.read_adjlist(fh, nodetype=int, delimiter=':')
assert_nodes_equal(list(H), list(G))
assert_edges_equal(list(H.edges()), list(G.edges()))
Example #9
| Source File: test_adjlist.py From Carnets with BSD 3-Clause "New" or "Revised" License | 5 votes |
|
def test_adjlist_multidigraph(self):
G = self.XDG
(fd, fname) = tempfile.mkstemp()
nx.write_adjlist(G, fname)
H = nx.read_adjlist(fname, nodetype=int,
create_using=nx.MultiDiGraph())
H2 = nx.read_adjlist(fname, nodetype=int,
create_using=nx.MultiDiGraph())
assert_not_equal(H, H2) # they should be different graphs
assert_nodes_equal(list(H), list(G))
assert_edges_equal(list(H.edges()), list(G.edges()))
os.close(fd)
os.unlink(fname)
Example #10
| Source File: test_adjlist.py From Carnets with BSD 3-Clause "New" or "Revised" License | 5 votes |
|
def test_adjlist_integers(self):
(fd, fname) = tempfile.mkstemp()
G = nx.convert_node_labels_to_integers(self.G)
nx.write_adjlist(G, fname)
H = nx.read_adjlist(fname, nodetype=int)
H2 = nx.read_adjlist(fname, nodetype=int)
assert_nodes_equal(list(H), list(G))
assert_edges_equal(list(H.edges()), list(G.edges()))
os.close(fd)
os.unlink(fname)
Example #11
| Source File: test_adjlist.py From Carnets with BSD 3-Clause "New" or "Revised" License | 5 votes |
|
def test_adjlist_digraph(self):
G = self.DG
(fd, fname) = tempfile.mkstemp()
nx.write_adjlist(G, fname)
H = nx.read_adjlist(fname, create_using=nx.DiGraph())
H2 = nx.read_adjlist(fname, create_using=nx.DiGraph())
assert_not_equal(H, H2) # they should be different graphs
assert_nodes_equal(list(H), list(G))
assert_edges_equal(list(H.edges()), list(G.edges()))
os.close(fd)
os.unlink(fname)
Example #12
| Source File: test_adjlist.py From Carnets with BSD 3-Clause "New" or "Revised" License | 5 votes |
|
def test_adjlist_graph(self):
G = self.G
(fd, fname) = tempfile.mkstemp()
nx.write_adjlist(G, fname)
H = nx.read_adjlist(fname)
H2 = nx.read_adjlist(fname)
assert_not_equal(H, H2) # they should be different graphs
assert_nodes_equal(list(H), list(G))
assert_edges_equal(list(H.edges()), list(G.edges()))
os.close(fd)
os.unlink(fname)
Example #13
| Source File: graph.py From BioNEV with MIT License | 5 votes |
|
def read_adjlist(self, filename):
""" Read graph from adjacency file in which the edge must be unweighted
the format of each line: v1 n1 n2 n3 ... nk
:param filename: the filename of input file
"""
self.G = nx.read_adjlist(filename, create_using=nx.DiGraph())
for i, j in self.G.edges():
self.G[i][j]['weight'] = 1.0
self.encode_node()
Example #14
| Source File: test_adjlist.py From qgisSpaceSyntaxToolkit with GNU General Public License v3.0 | 5 votes |
|
def test_adjlist_delimiter(self):
fh=io.BytesIO()
G = nx.path_graph(3)
nx.write_adjlist(G, fh, delimiter=':')
fh.seek(0)
H = nx.read_adjlist(fh, nodetype=int, delimiter=':')
assert_nodes_equal(H.nodes(),G.nodes())
assert_edges_equal(H.edges(),G.edges())
Example #15
| Source File: test_adjlist.py From qgisSpaceSyntaxToolkit with GNU General Public License v3.0 | 5 votes |
|
def test_adjlist_multidigraph(self):
G=self.XDG
(fd,fname)=tempfile.mkstemp()
nx.write_adjlist(G,fname)
H=nx.read_adjlist(fname,nodetype=int,
create_using=nx.MultiDiGraph())
H2=nx.read_adjlist(fname,nodetype=int,
create_using=nx.MultiDiGraph())
assert_not_equal(H,H2) # they should be different graphs
assert_nodes_equal(H.nodes(),G.nodes())
assert_edges_equal(H.edges(),G.edges())
os.close(fd)
os.unlink(fname)
Example #16
| Source File: test_adjlist.py From qgisSpaceSyntaxToolkit with GNU General Public License v3.0 | 5 votes |
|
def test_adjlist_multigraph(self):
G=self.XG
(fd,fname)=tempfile.mkstemp()
nx.write_adjlist(G,fname)
H=nx.read_adjlist(fname,nodetype=int,
create_using=nx.MultiGraph())
H2=nx.read_adjlist(fname,nodetype=int,
create_using=nx.MultiGraph())
assert_not_equal(H,H2) # they should be different graphs
assert_nodes_equal(H.nodes(),G.nodes())
assert_edges_equal(H.edges(),G.edges())
os.close(fd)
os.unlink(fname)
Example #17
| Source File: test_adjlist.py From qgisSpaceSyntaxToolkit with GNU General Public License v3.0 | 5 votes |
|
def test_adjlist_integers(self):
(fd,fname)=tempfile.mkstemp()
G=nx.convert_node_labels_to_integers(self.G)
nx.write_adjlist(G,fname)
H=nx.read_adjlist(fname,nodetype=int)
H2=nx.read_adjlist(fname,nodetype=int)
assert_nodes_equal(H.nodes(),G.nodes())
assert_edges_equal(H.edges(),G.edges())
os.close(fd)
os.unlink(fname)
Example #18
| Source File: test_adjlist.py From qgisSpaceSyntaxToolkit with GNU General Public License v3.0 | 5 votes |
|
def test_adjlist_graph(self):
G=self.G
(fd,fname)=tempfile.mkstemp()
nx.write_adjlist(G,fname)
H=nx.read_adjlist(fname)
H2=nx.read_adjlist(fname)
assert_not_equal(H,H2) # they should be different graphs
assert_nodes_equal(H.nodes(),G.nodes())
assert_edges_equal(H.edges(),G.edges())
os.close(fd)
os.unlink(fname)
Example #19
| Source File: graph.py From GPF with MIT License | 5 votes |
|
def read_adjlist(self, filename):
""" Read graph from adjacency file in which the edge must be unweighted
the format of each line: v1 n1 n2 n3 ... nk
:param filename: the filename of input file
"""
self.G = nx.read_adjlist(filename, nodetype=int, create_using=nx.DiGraph())
for i, j in self.G.edges():
self.G[i][j]['weight'] = 1.0
self.encode_node()
Example #20
| Source File: graph.py From OpenNE with MIT License | 5 votes |
|
def read_adjlist(self, filename):
""" Read graph from adjacency file in which the edge must be unweighted
the format of each line: v1 n1 n2 n3 ... nk
:param filename: the filename of input file
"""
self.G = nx.read_adjlist(filename, create_using=nx.DiGraph())
for i, j in self.G.edges():
self.G[i][j]['weight'] = 1.0
self.encode_node()
Example #21
| Source File: adjlist.py From Carnets with BSD 3-Clause "New" or "Revised" License | 4 votes |
|
def generate_adjlist(G, delimiter=' '):
"""Generate a single line of the graph G in adjacency list format.
Parameters
----------
G : NetworkX graph
delimiter : string, optional
Separator for node labels
Returns
-------
lines : string
Lines of data in adjlist format.
Examples
--------
>>> G = nx.lollipop_graph(4, 3)
>>> for line in nx.generate_adjlist(G):
... print(line)
0 1 2 3
1 2 3
2 3
3 4
4 5
5 6
6
See Also
--------
write_adjlist, read_adjlist
"""
directed = G.is_directed()
seen = set()
for s, nbrs in G.adjacency():
line = make_str(s) + delimiter
for t, data in nbrs.items():
if not directed and t in seen:
continue
if G.is_multigraph():
for d in data.values():
line += make_str(t) + delimiter
else:
line += make_str(t) + delimiter
if not directed:
seen.add(s)
yield line[:-len(delimiter)]
Example #22
| Source File: adjlist.py From Carnets with BSD 3-Clause "New" or "Revised" License | 4 votes |
|
def write_adjlist(G, path, comments="#", delimiter=' ', encoding='utf-8'):
"""Write graph G in single-line adjacency-list format to path.
Parameters
----------
G : NetworkX graph
path : string or file
Filename or file handle for data output.
Filenames ending in .gz or .bz2 will be compressed.
comments : string, optional
Marker for comment lines
delimiter : string, optional
Separator for node labels
encoding : string, optional
Text encoding.
Examples
--------
>>> G=nx.path_graph(4)
>>> nx.write_adjlist(G,"test.adjlist")
The path can be a filehandle or a string with the name of the file. If a
filehandle is provided, it has to be opened in 'wb' mode.
>>> fh=open("test.adjlist",'wb')
>>> nx.write_adjlist(G, fh)
Notes
-----
This format does not store graph, node, or edge data.
See Also
--------
read_adjlist, generate_adjlist
"""
import sys
import time
pargs = comments + " ".join(sys.argv) + '\n'
header = (pargs
+ comments + " GMT {}\n".format(time.asctime(time.gmtime()))
+ comments + " {}\n".format(G.name))
path.write(header.encode(encoding))
for line in generate_adjlist(G, delimiter):
line += '\n'
path.write(line.encode(encoding))
Example #23
| Source File: adjlist.py From aws-kube-codesuite with Apache License 2.0 | 4 votes |
|
def generate_adjlist(G, delimiter=' '):
"""Generate a single line of the graph G in adjacency list format.
Parameters
----------
G : NetworkX graph
delimiter : string, optional
Separator for node labels
Returns
-------
lines : string
Lines of data in adjlist format.
Examples
--------
>>> G = nx.lollipop_graph(4, 3)
>>> for line in nx.generate_adjlist(G):
... print(line)
0 1 2 3
1 2 3
2 3
3 4
4 5
5 6
6
See Also
--------
write_adjlist, read_adjlist
"""
directed = G.is_directed()
seen = set()
for s, nbrs in G.adjacency():
line = make_str(s) + delimiter
for t, data in nbrs.items():
if not directed and t in seen:
continue
if G.is_multigraph():
for d in data.values():
line += make_str(t) + delimiter
else:
line += make_str(t) + delimiter
if not directed:
seen.add(s)
yield line[:-len(delimiter)]
Example #24
| Source File: adjlist.py From aws-kube-codesuite with Apache License 2.0 | 4 votes |
|
def write_adjlist(G, path, comments="#", delimiter=' ', encoding='utf-8'):
"""Write graph G in single-line adjacency-list format to path.
Parameters
----------
G : NetworkX graph
path : string or file
Filename or file handle for data output.
Filenames ending in .gz or .bz2 will be compressed.
comments : string, optional
Marker for comment lines
delimiter : string, optional
Separator for node labels
encoding : string, optional
Text encoding.
Examples
--------
>>> G=nx.path_graph(4)
>>> nx.write_adjlist(G,"test.adjlist")
The path can be a filehandle or a string with the name of the file. If a
filehandle is provided, it has to be opened in 'wb' mode.
>>> fh=open("test.adjlist",'wb')
>>> nx.write_adjlist(G, fh)
Notes
-----
This format does not store graph, node, or edge data.
See Also
--------
read_adjlist, generate_adjlist
"""
import sys
import time
pargs = comments + " ".join(sys.argv) + '\n'
header = (pargs
+ comments + " GMT {}\n".format(time.asctime(time.gmtime()))
+ comments + " {}\n".format(G.name))
path.write(header.encode(encoding))
for line in generate_adjlist(G, delimiter):
line += '\n'
path.write(line.encode(encoding))
Example #25
| Source File: test_adjlist.py From qgisSpaceSyntaxToolkit with GNU General Public License v3.0 | 4 votes |
|
def test_adjlist_digraph(self):
G=self.DG
(fd,fname)=tempfile.mkstemp()
nx.write_adjlist(G,fname)
H=nx.read_adjlist(fname,create_using=nx.DiGraph())
H2=nx.read_adjlist(fname,create_using=nx.DiGraph())
assert_not_equal(H,H2) # they should be different graphs
assert_nodes_equal(H.nodes(),G.nodes())
assert_edges_equal(H.edges(),G.edges())
os.close(fd)
os.unlink(fname)
Example #26
| Source File: adjlist.py From qgisSpaceSyntaxToolkit with GNU General Public License v3.0 | 4 votes |
|
def write_adjlist(G, path, comments="#", delimiter=' ', encoding = 'utf-8'):
"""Write graph G in single-line adjacency-list format to path.
Parameters
----------
G : NetworkX graph
path : string or file
Filename or file handle for data output.
Filenames ending in .gz or .bz2 will be compressed.
comments : string, optional
Marker for comment lines
delimiter : string, optional
Separator for node labels
encoding : string, optional
Text encoding.
Examples
--------
>>> G=nx.path_graph(4)
>>> nx.write_adjlist(G,"test.adjlist")
The path can be a filehandle or a string with the name of the file. If a
filehandle is provided, it has to be opened in 'wb' mode.
>>> fh=open("test.adjlist",'wb')
>>> nx.write_adjlist(G, fh)
Notes
-----
This format does not store graph, node, or edge data.
See Also
--------
read_adjlist, generate_adjlist
"""
import sys
import time
pargs=comments + " ".join(sys.argv) + '\n'
header = (pargs
+ comments + " GMT %s\n" % (time.asctime(time.gmtime()))
+ comments + " %s\n" % (G.name))
path.write(header.encode(encoding))
for line in generate_adjlist(G, delimiter):
line+='\n'
path.write(line.encode(encoding))
Example #27
| Source File: adjlist.py From qgisSpaceSyntaxToolkit with GNU General Public License v3.0 | 4 votes |
|
def generate_adjlist(G, delimiter = ' '):
"""Generate a single line of the graph G in adjacency list format.
Parameters
----------
G : NetworkX graph
delimiter : string, optional
Separator for node labels
Returns
-------
lines : string
Lines of data in adjlist format.
Examples
--------
>>> G = nx.lollipop_graph(4, 3)
>>> for line in nx.generate_adjlist(G):
... print(line)
0 1 2 3
1 2 3
2 3
3 4
4 5
5 6
6
See Also
--------
write_adjlist, read_adjlist
"""
directed=G.is_directed()
seen=set()
for s,nbrs in G.adjacency_iter():
line = make_str(s)+delimiter
for t,data in nbrs.items():
if not directed and t in seen:
continue
if G.is_multigraph():
for d in data.values():
line += make_str(t) + delimiter
else:
line += make_str(t) + delimiter
if not directed:
seen.add(s)
yield line[:-len(delimiter)]
