Skip to main content
Ctrl+K
EasyGraph 1.4.1 - Home

Site Navigation

  • Installation
  • Examples of Graph Analysis
  • EasyHypergraph
  • EGGPU
  • Reference
    • Tutorial
    • Contributor Guide
    • License
    • Source Code
    • Honors
    • Developer Documentation
  • GitHub

Site Navigation

  • Installation
  • Examples of Graph Analysis
  • EasyHypergraph
  • EGGPU
  • Reference
    • Tutorial
    • Contributor Guide
    • License
    • Source Code
    • Honors
    • Developer Documentation
  • GitHub

Section Navigation

Contents:

  • Documentation
  • Reference
  • easygraph.readwrite.json_graph package
  • easygraph.re...

easygraph.readwrite.json_graph.node_link module#

easygraph.readwrite.json_graph.node_link.node_link_graph(data, directed=False, multigraph=True, attrs=None)[source]#

Returns graph from node-link data format.

Parameters:
  • data (dict) – node-link formatted graph data

  • directed (bool) – If True, and direction not specified in data, return a directed graph.

  • multigraph (bool) – If True, and multigraph not specified in data, return a multigraph.

  • attrs (dict) –

    A dictionary that contains five keys ‘source’, ‘target’, ‘name’, ‘key’ and ‘link’. The corresponding values provide the attribute names for storing NetworkX-internal graph data. Default value:

    dict(source=’source’, target=’target’, name=’id’,

    key=’key’, link=’links’)

Returns:

G – A EasyGraph graph object

Return type:

EasyGraph graph

Examples

>>> from easygraph.readwrite import json_graph
>>> G = eg.Graph([("A", "B")])
>>> data = json_graph.node_link_data(G)
>>> H = json_graph.node_link_graph(data)

Notes

Attribute ‘key’ is only used for multigraphs.

See also

node_link_data, adjacency_data, tree_data

previous

easygraph.readwrite.json_graph package

next

easygraph.readwrite.edgelist module

On this page
  • node_link_graph()
Show Source

© Copyright 2020-2025, DataNET Group, Fudan University.

Created using Sphinx 7.1.2.

Built with the PyData Sphinx Theme 0.14.4.