https://github.com/networkx/grave

Grave—dead simple graph visualization
https://github.com/networkx/grave

graph-visualization networkx python

Last synced: 3 months ago
JSON representation

Grave—dead simple graph visualization

• Host: GitHub
• URL: https://github.com/networkx/grave
• Owner: networkx
• License: other
• Created: 2018-03-29T03:44:24.000Z (over 6 years ago)
• Default Branch: main
• Last Pushed: 2022-09-19T19:22:07.000Z (about 2 years ago)
• Last Synced: 2024-04-15T14:49:20.790Z (7 months ago)
• Topics: graph-visualization, networkx, python
• Language: Python
• Homepage: https://networkx.github.io/grave/
• Size: 5.42 MB
• Stars: 94
• Watchers: 17
• Forks: 29
• Open Issues: 9
• Metadata Files:
  • Readme: README.rst
  • Contributing: CONTRIBUTING.rst
  • License: LICENSE

Awesome Lists containing this project

README

        
Grave—dead simple graph visualization

=====================================

.. image:: https://img.shields.io/pypi/v/grave.svg

   :target: https://pypi.org/project/grave/

.. image:: https://github.com/networkx/grave/workflows/test/badge.svg?branch=main

     :target: https://github.com/networkx/grave/actions?query=workflow%3A%22test%22

.. image:: https://codecov.io/gh/networkx/grave/branch/main/graph/badge.svg

      :target: https://app.codecov.io/gh/networkx/grave/branch/main

.. GH breaks rendering of SVG from the repo, so we redirect through rawgit.com.

   GH ignores the width and align directives for PNGs.

.. image:: https://rawgit.com/networkx/grave/main/doc/_static/default.svg

   :width: 250px

   :align: right

   :alt: Logo

Grave is a graph visualization package combining ideas from Matplotlib,

NetworkX, and seaborn. Its goal is to provide a network drawing API that

covers the most use cases with sensible defaults and simple style

configuration. Currently, it supports drawing graphs from NetworkX.

- **Website (including documentation):** https://networkx.github.io/grave/

- **Mailing list:** https://groups.google.com/forum/#!forum/networkx-discuss

- **Source:** https://github.com/networkx/grave

- **Bug reports:** https://github.com/networkx/grave/issues

Example

-------

Here, we create a graph and color the nodes in its minimum weighted

dominating set:

.. code:: python

    import matplotlib.pyplot as plt

    import networkx as nx

    from networkx.algorithms.approximation.dominating_set import min_weighted_dominating_set

    from grave import plot_network

    network = nx.powerlaw_cluster_graph(50, 1, .2)

    dom_set = min_weighted_dominating_set(network)

    for node, node_attrs in network.nodes(data=True):

        node_attrs['is_dominator'] = True if node in dom_set else False

    def color_dominators(node_attrs):

        if node_attrs.get('is_dominator', False):

            return {'color': 'red'}

        else:

            return {'color': 'black'}

    fig, ax = plt.subplots()

    plot_network(network, node_style=color_dominators)

    plt.show()

The result:

.. image:: https://rawgit.com/networkx/grave/main/doc/_static/dominators.svg

    :width: 700

    :align: center

    :alt: Coloring the minimum weighted dominating set of a graph

License

-------

Released under the 3-Clause BSD license (see `LICENSE`).