Graph

Wiki ▸ API Reference ▸ Core ▸ Graph

Graph

• reorder.graph - create a graph object.
• graph.nodes - get or set the array of nodes.
• graph.node_indices - return the list of node indices.
• graph.generate_nodes - fills the graph with n nodes.
• graph.links - get or set the array of links between nodes.
• graph.link_indices - return the list of node indices.
• graph.link_distance - get or set the link distance.
• graph.directed - get or set whether the graph is directed or not.
• graph.init - initialize the graph structure.
• graph.edges - return the edges connected to a node.
• graph.inEdges - return the incoming edges of a node in a directed graph.
• graph.outEdges - return the outgoing edges of a node in a directed graph.
• graph.degree - return the degree (number of edges) of a node.
• graph.inDegree - return the number of incoming edges of a node in a directed graph.
• graph.outDegree - return the number of outgoing edges of a node in a directed graph.
• graph.sinks - return the nodes with no outgoing edges in a directed graph.
• graph.sources - return the nodes with no incoming edges in a directed graph.
• graph.distance - return the distance of a link.
• graph.neighbors - return the list of nodes with an edge to the specified node.
• graph.other - return the other endpoint of an edge, given a link and an edge.
• graph.components - return the list of connected components of the graph.
• reorder.graph_random_erdos_renyi - return a random graph.
• reorder.graph_empty - return a graph with a specified number of nodes and no links.
• reorder.graph_random - return a random graph with a specified size.
• reorder.graph_complete - return a complete graph with a specified size.
• reorder.graph_connect - connect all the components of a specified graph.
• reorder.all_pairs_distance - return the distance matrix of the weighted graph.
• reorder.bfs - apply a function over the nodes of a graph in Breadth-First order.
• reorder.bfs_distances - compute the Breadth-First distances from a node of a graph.
• reorder.all_pairs_distance_bfs - compute the distance between all nodes of a graph using the Breadth-First-Search algorithm.