class NetworkXToolkit(BaseToolkit):
def _get_nx(cls):
def __init__(
self,
timeout: Optional[float] = None,
graph_type: Literal['graph', 'digraph', 'multigraph', 'multidigraph'] = 'graph'
):
None
)def add_node(self, node_id: str, **attributes: Any):
def add_edge(
self,
source: str,
target: str,
**attributes: Any
):
def get_nodes(self):
def get_edges(self):
def get_shortest_path(
self,
source: str,
target: str,
weight: Optional[Union[str, Callable]] = None,
method: Literal['dijkstra', 'bellman-ford'] = 'dijkstra'
):
Literal['dijkstra', 'bellman-ford'], optional
): Algorithm to compute the path. Ignored if weight is None. (default: :obj:'dijkstra'
)def compute_centrality(self):
def serialize_graph(self):
def deserialize_graph(self, data: str):
def export_to_file(self, file_path: str):
def import_from_file(self, file_path: str):
def clear_graph(self):
def get_tools(self):