grape.general\_graph.GeneralGraph
=================================

.. currentmodule:: grape.general_graph

.. autoclass:: GeneralGraph

   
   .. automethod:: __init__

   
   .. rubric:: Methods

   .. autosummary::
   
      ~GeneralGraph.__init__
      ~GeneralGraph.add_edge
      ~GeneralGraph.add_edges_from
      ~GeneralGraph.add_node
      ~GeneralGraph.add_nodes_from
      ~GeneralGraph.add_weighted_edges_from
      ~GeneralGraph.adjacency
      ~GeneralGraph.betweenness_centrality_kernel
      ~GeneralGraph.calculate_shortest_path
      ~GeneralGraph.clear
      ~GeneralGraph.clear_data
      ~GeneralGraph.clear_edges
      ~GeneralGraph.closeness_centrality_kernel
      ~GeneralGraph.compute_betweenness_centrality
      ~GeneralGraph.compute_closeness_centrality
      ~GeneralGraph.compute_degree_centrality
      ~GeneralGraph.compute_efficiency
      ~GeneralGraph.compute_indegree_centrality
      ~GeneralGraph.compute_local_efficiency
      ~GeneralGraph.compute_nodal_efficiency
      ~GeneralGraph.compute_outdegree_centrality
      ~GeneralGraph.compute_service
      ~GeneralGraph.construct_path_kernel
      ~GeneralGraph.copy
      ~GeneralGraph.degree_centrality_kernel
      ~GeneralGraph.dijkstra_single_source_shortest_path
      ~GeneralGraph.edge_subgraph
      ~GeneralGraph.efficiency_kernel
      ~GeneralGraph.floyd_warshall_initialization
      ~GeneralGraph.floyd_warshall_kernel
      ~GeneralGraph.floyd_warshall_predecessor_and_distance
      ~GeneralGraph.get_edge_data
      ~GeneralGraph.has_edge
      ~GeneralGraph.has_node
      ~GeneralGraph.has_predecessor
      ~GeneralGraph.has_successor
      ~GeneralGraph.indegree_centrality_kernel
      ~GeneralGraph.is_directed
      ~GeneralGraph.is_multigraph
      ~GeneralGraph.load
      ~GeneralGraph.local_efficiency_kernel
      ~GeneralGraph.nbunch_iter
      ~GeneralGraph.neighbors
      ~GeneralGraph.nodal_efficiency_kernel
      ~GeneralGraph.number_of_edges
      ~GeneralGraph.number_of_nodes
      ~GeneralGraph.order
      ~GeneralGraph.outdegree_centrality_kernel
      ~GeneralGraph.predecessors
      ~GeneralGraph.remove_edge
      ~GeneralGraph.remove_edges_from
      ~GeneralGraph.remove_node
      ~GeneralGraph.remove_nodes_from
      ~GeneralGraph.reverse
      ~GeneralGraph.shortest_path_list_kernel
      ~GeneralGraph.size
      ~GeneralGraph.subgraph
      ~GeneralGraph.successors
      ~GeneralGraph.to_directed
      ~GeneralGraph.to_directed_class
      ~GeneralGraph.to_undirected
      ~GeneralGraph.to_undirected_class
      ~GeneralGraph.update
   
   

   
   
   .. rubric:: Attributes

   .. autosummary::
   
      ~GeneralGraph.adj
      ~GeneralGraph.area
      ~GeneralGraph.betweenness_centrality
      ~GeneralGraph.closeness_centrality
      ~GeneralGraph.degree
      ~GeneralGraph.degree_centrality
      ~GeneralGraph.description
      ~GeneralGraph.edges
      ~GeneralGraph.efficiency
      ~GeneralGraph.father_condition
      ~GeneralGraph.final_status
      ~GeneralGraph.global_efficiency
      ~GeneralGraph.in_degree
      ~GeneralGraph.in_edges
      ~GeneralGraph.indegree_centrality
      ~GeneralGraph.init_status
      ~GeneralGraph.initial_service
      ~GeneralGraph.local_efficiency
      ~GeneralGraph.mark
      ~GeneralGraph.mark_status
      ~GeneralGraph.name
      ~GeneralGraph.nodal_efficiency
      ~GeneralGraph.nodes
      ~GeneralGraph.out_degree
      ~GeneralGraph.out_edges
      ~GeneralGraph.outdegree_centrality
      ~GeneralGraph.perturbation_resistant
      ~GeneralGraph.pred
      ~GeneralGraph.service
      ~GeneralGraph.shortest_path
      ~GeneralGraph.shortest_path_length
      ~GeneralGraph.sources
      ~GeneralGraph.status_area
      ~GeneralGraph.succ
      ~GeneralGraph.switches
      ~GeneralGraph.type
      ~GeneralGraph.users
      ~GeneralGraph.weight