grape.parallel\_general\_graph.ParallelGeneralGraph
===================================================

.. currentmodule:: grape.parallel_general_graph

.. autoclass:: ParallelGeneralGraph

   
   .. automethod:: __init__

   
   .. rubric:: Methods

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

   
   
   .. rubric:: Attributes

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