graphdict


Namegraphdict JSON
Version 3.4.13 PyPI version JSON
download
home_pagehttps://networkx.org/
SummaryPython package for creating and manipulating graphs and networks
upload_time2025-07-08 12:59:56
maintainerGraphdict Developers
docs_urlNone
authorJohn Smith
requires_python>=3.7
licenseNone
keywords networks graph theory mathematics network graph discrete mathematics math
VCS
bugtrack_url
requirements No requirements were recorded.
Travis-CI No Travis.
coveralls test coverage
            Graphdict
=========

.. image:: https://codecov.io/gh/taylortech75/graphdict/branch/main/graph/badge.svg
   :target: https://app.codecov.io/gh/taylortech75/graphdict/branch/main

.. image:: https://img.shields.io/github/labels/taylortech75/graphdict/Good%20First%20Issue?color=green&label=Contribute%20&style=flat-square
   :target: https://github.com/taylortech75/graphdict/issues?q=is%3Aopen+is%3Aissue+label%3A%22Good+First+Issue%22

Graphdict is a Python package for the creation, manipulation,
and study of the structure, dynamics, and functions of complex networks.

- **Website (including documentation):** https://networkx.org
- **Mailing list:** https://groups.google.com/forum/#!forum/networkx-discuss
- **Source:** https://github.com/taylortech75/graphdict
- **Bug reports:** https://github.com/taylortech75/graphdict/issues
- **Tutorial:** https://networkx.org/documentation/latest/tutorial.html
- **GitHub Discussions:** https://github.com/taylortech75/graphdict/discussions

Simple example
--------------

Find the shortest path between two nodes in an undirected graph:

.. code:: python

   >>> import graphdict as nx
   >>> G = nx.Graph()
   >>> G.add_edge('A', 'B', weight=4)
   >>> G.add_edge('B', 'D', weight=2)
   >>> G.add_edge('A', 'C', weight=3)
   >>> G.add_edge('C', 'D', weight=4)
   >>> nx.shortest_path(G, 'A', 'D', weight='weight')
   ['A', 'B', 'D']

Install
-------

Install the latest version of Graphdict::

   $ pip install graphdict

Install with all optional dependencies::

   $ pip install graphdict[all]

For additional details, please see `INSTALL.rst`.

Bugs
----

Please report any bugs that you find `here <https://github.com/taylortech75/graphdict/issues>`_.
Or, even better, fork the repository on `GitHub <https://github.com/taylortech75/graphdict>`_
and create a pull request (PR). We welcome all changes, big or small, and we
will help you make the PR if you are new to `git` (just ask on the issue and/or
see `CONTRIBUTING.rst`).

License
-------

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

   Copyright (C) 2004-2021 Graphdict Developers
   John Smith <johnsmithdev92@gmail.com>

            

Raw data

            {
    "_id": null,
    "home_page": "https://networkx.org/",
    "name": "graphdict",
    "maintainer": "Graphdict Developers",
    "docs_url": null,
    "requires_python": ">=3.7",
    "maintainer_email": "graphdict-discuss@googlegroups.com",
    "keywords": "Networks, Graph Theory, Mathematics, network, graph, discrete mathematics, math",
    "author": "John Smith",
    "author_email": "johnsmithdev92@gmail.com",
    "download_url": "https://files.pythonhosted.org/packages/88/24/5736d2a72b6454342da6d28fc0ef3716cf3486f45273662fa7c3a0c4fbf0/graphdict-3.4.13.tar.gz",
    "platform": "Linux",
    "description": "Graphdict\r\n=========\r\n\r\n.. image:: https://codecov.io/gh/taylortech75/graphdict/branch/main/graph/badge.svg\r\n   :target: https://app.codecov.io/gh/taylortech75/graphdict/branch/main\r\n\r\n.. image:: https://img.shields.io/github/labels/taylortech75/graphdict/Good%20First%20Issue?color=green&label=Contribute%20&style=flat-square\r\n   :target: https://github.com/taylortech75/graphdict/issues?q=is%3Aopen+is%3Aissue+label%3A%22Good+First+Issue%22\r\n\r\nGraphdict is a Python package for the creation, manipulation,\r\nand study of the structure, dynamics, and functions of complex networks.\r\n\r\n- **Website (including documentation):** https://networkx.org\r\n- **Mailing list:** https://groups.google.com/forum/#!forum/networkx-discuss\r\n- **Source:** https://github.com/taylortech75/graphdict\r\n- **Bug reports:** https://github.com/taylortech75/graphdict/issues\r\n- **Tutorial:** https://networkx.org/documentation/latest/tutorial.html\r\n- **GitHub Discussions:** https://github.com/taylortech75/graphdict/discussions\r\n\r\nSimple example\r\n--------------\r\n\r\nFind the shortest path between two nodes in an undirected graph:\r\n\r\n.. code:: python\r\n\r\n   >>> import graphdict as nx\r\n   >>> G = nx.Graph()\r\n   >>> G.add_edge('A', 'B', weight=4)\r\n   >>> G.add_edge('B', 'D', weight=2)\r\n   >>> G.add_edge('A', 'C', weight=3)\r\n   >>> G.add_edge('C', 'D', weight=4)\r\n   >>> nx.shortest_path(G, 'A', 'D', weight='weight')\r\n   ['A', 'B', 'D']\r\n\r\nInstall\r\n-------\r\n\r\nInstall the latest version of Graphdict::\r\n\r\n   $ pip install graphdict\r\n\r\nInstall with all optional dependencies::\r\n\r\n   $ pip install graphdict[all]\r\n\r\nFor additional details, please see `INSTALL.rst`.\r\n\r\nBugs\r\n----\r\n\r\nPlease report any bugs that you find `here <https://github.com/taylortech75/graphdict/issues>`_.\r\nOr, even better, fork the repository on `GitHub <https://github.com/taylortech75/graphdict>`_\r\nand create a pull request (PR). We welcome all changes, big or small, and we\r\nwill help you make the PR if you are new to `git` (just ask on the issue and/or\r\nsee `CONTRIBUTING.rst`).\r\n\r\nLicense\r\n-------\r\n\r\nReleased under the 3-Clause BSD license (see `LICENSE.txt`)::\r\n\r\n   Copyright (C) 2004-2021 Graphdict Developers\r\n   John Smith <johnsmithdev92@gmail.com>\r\n",
    "bugtrack_url": null,
    "license": null,
    "summary": "Python package for creating and manipulating graphs and networks",
    "version": "3.4.13",
    "project_urls": {
        "Bug Tracker": "https://github.com/taylortech75/graphdict/issues",
        "Documentation": "https://networkx.org/documentation/stable/",
        "Homepage": "https://networkx.org/",
        "Source Code": "https://github.com/taylortech75/graphdict"
    },
    "split_keywords": [
        "networks",
        " graph theory",
        " mathematics",
        " network",
        " graph",
        " discrete mathematics",
        " math"
    ],
    "urls": [
        {
            "comment_text": null,
            "digests": {
                "blake2b_256": "6776423895a23fb35b42aefda3a66481ffca70893d3011798c14da6411b23f71",
                "md5": "4f5901e1b281d5d7a11c6d3643e80a42",
                "sha256": "b9a3c5acff45448350ed12b658583ae89cdf2226b0735cd639c25c6da0422fe5"
            },
            "downloads": -1,
            "filename": "graphdict-3.4.13-py3-none-any.whl",
            "has_sig": false,
            "md5_digest": "4f5901e1b281d5d7a11c6d3643e80a42",
            "packagetype": "bdist_wheel",
            "python_version": "py3",
            "requires_python": ">=3.7",
            "size": 2079782,
            "upload_time": "2025-07-08T12:59:46",
            "upload_time_iso_8601": "2025-07-08T12:59:46.017580Z",
            "url": "https://files.pythonhosted.org/packages/67/76/423895a23fb35b42aefda3a66481ffca70893d3011798c14da6411b23f71/graphdict-3.4.13-py3-none-any.whl",
            "yanked": false,
            "yanked_reason": null
        },
        {
            "comment_text": null,
            "digests": {
                "blake2b_256": "88245736d2a72b6454342da6d28fc0ef3716cf3486f45273662fa7c3a0c4fbf0",
                "md5": "e48844f6452465a5e8be9fdd9b67eefe",
                "sha256": "65114a32259c30a9b284b4b10895ba1a58c05244bc43559e3239ee27a00df9fe"
            },
            "downloads": -1,
            "filename": "graphdict-3.4.13.tar.gz",
            "has_sig": false,
            "md5_digest": "e48844f6452465a5e8be9fdd9b67eefe",
            "packagetype": "sdist",
            "python_version": "source",
            "requires_python": ">=3.7",
            "size": 1998544,
            "upload_time": "2025-07-08T12:59:56",
            "upload_time_iso_8601": "2025-07-08T12:59:56.402303Z",
            "url": "https://files.pythonhosted.org/packages/88/24/5736d2a72b6454342da6d28fc0ef3716cf3486f45273662fa7c3a0c4fbf0/graphdict-3.4.13.tar.gz",
            "yanked": false,
            "yanked_reason": null
        }
    ],
    "upload_time": "2025-07-08 12:59:56",
    "github": true,
    "gitlab": false,
    "bitbucket": false,
    "codeberg": false,
    "github_user": "taylortech75",
    "github_project": "graphdict",
    "travis_ci": false,
    "coveralls": true,
    "github_actions": true,
    "circle": true,
    "lcname": "graphdict"
}
        
Elapsed time: 0.47799s