Labeled DiGraph

Overview

class LabeledDiGraph(data=None, name='', weighted=True)

Adding and Removing Nodes and Edges

LabeledDiGraph.add_node (n[, data])
LabeledDiGraph.add_nodes_from (nbunch[, data])
LabeledDiGraph.remove_node (n)
LabeledDiGraph.remove_nodes_from (nbunch)
LabeledDiGraph.add_edge (u, v[, data])	Add an edge between u and v with optional data.
LabeledDiGraph.add_edges_from (ebunch[, data])	Add all the edges in ebunch.
LabeledDiGraph.remove_edge (u, v)	Remove the edge between (u,v).
LabeledDiGraph.remove_edges_from (ebunch)	Remove all edges specified in ebunch.
LabeledDiGraph.add_star (nlist[, data])	Add a star.
LabeledDiGraph.add_path (nlist[, data])	Add a path.
LabeledDiGraph.add_cycle (nlist[, data])	Add a cycle.
LabeledDiGraph.clear ()

Iterating over nodes and edges

LabeledDiGraph.nodes ([nbunch, data])
LabeledDiGraph.nodes_iter ([nbunch, data])
LabeledDiGraph.__iter__ ()	Iterate over the nodes. Use “for n in G”.
LabeledDiGraph.edges ([nbunch, data])	Return a list of edges.
LabeledDiGraph.edges_iter ([nbunch, data])	Return an iterator over the edges.
LabeledDiGraph.get_edge (u, v[, default])	Return the data associated with the edge (u,v).
LabeledDiGraph.neighbors (n)	Return a list of the nodes connected to the node n.
LabeledDiGraph.neighbors_iter (n)	Return an iterator over all neighbors of node n.
LabeledDiGraph.__getitem__ (n)	Return the neighbors of node n. Use “G[n]”.
LabeledDiGraph.successors (n)	Return a list of the nodes connected to the node n.
LabeledDiGraph.successors_iter (n)	Return an iterator over all neighbors of node n.
LabeledDiGraph.predecessors (n)	Return a list of predecessor nodes of n.
LabeledDiGraph.predecessors_iter (n)	Return an iterator over predecessor nodes of n.
LabeledDiGraph.adjacency_list ()	Return an adjacency list as a Python list of lists
LabeledDiGraph.adjacency_iter ()	Return an iterator of (node, adjacency dict) tuples for all nodes.
LabeledDiGraph.nbunch_iter ([nbunch])	Return an iterator of nodes contained in nbunch that are also in the graph.

Information about graph structure

LabeledDiGraph.has_node (n)	Return True if graph has node n.
LabeledDiGraph.__contains__ (n)	Return True if n is a node, False otherwise. Use “n in G”.
LabeledDiGraph.has_edge (u, v)	Return True if graph contains the edge (u,v), False otherwise.
LabeledDiGraph.has_neighbor (u, v)	Return True if node u has neighbor v.
LabeledDiGraph.nodes_with_selfloops ()	Return a list of nodes with self loops.
LabeledDiGraph.selfloop_edges ([data])	Return a list of selfloop edges
LabeledDiGraph.order ()	Return the number of nodes.
LabeledDiGraph.number_of_nodes ()	Return the number of nodes.
LabeledDiGraph.__len__ ()	Return the number of nodes. Use “len(G)”.
LabeledDiGraph.size ([weighted])	Return the number of edges.
LabeledDiGraph.number_of_edges ([u, v])	Return the number of edges between two nodes.
LabeledDiGraph.number_of_selfloops ()	Return the number of selfloop edges (edge from a node to itself).
LabeledDiGraph.degree ([nbunch, with_labels, ...])	Return the degree of a node or nodes.
LabeledDiGraph.degree_iter ([nbunch, weighted])	Return an iterator for (node, degree).

Making copies and subgraphs

LabeledDiGraph.copy ()	Return a copy of the graph.
LabeledDiGraph.to_undirected ()	Return an undirected representation of the digraph.
LabeledDiGraph.subgraph (nbunch[, copy])
LabeledDiGraph.reverse ([copy])	Return the reverse of the graph