Functions for creating nctx graphs.

create_graph()

Creates a graph

load_graph()

Loads a graph from file

copy_from_igraph()

Create a graph as a copy of an igraph graph.

Obtain shortest-paths under contextual constraints.

shortest_path_ctx()

Obtain shortest paths with dynamic contextual constraints.

find_path_ctx()

Find a shortest paths with dynamic contextual constraints

all_pairs_shortest_paths_ctx()

Obtain all shortest paths with dynamic contextual constraints

Obtain centrality metrics for attributed graphs enforcing contextual constraints.

betweenness_ctx()

Betweenness centrality with dynamic contextual constraints.

closeness_ctx()

Closeness centrality with dynamic contextual constraints.

Functions for modifying nctx graphs.

add_edge()

Add an edge to the graph

add_vertex()

Add a vertex to the graph

Utility functions for graph objects

get_vertex_attribute_names()

Get the available vertex attributes

get_vertex_attribute()

Get a vertex attribute

get_vertex_attributes()

Get an attribute list for all vertices

set_vertex_attributes()

Set attributes for all vertices

is_directed()

Check if a graph is directed

is_nctxgraph()

Checks for a given object if it is a nctx graph

num_edges()

Get the number of edges of a graph

num_vertices()

Get the number of vertices of a graph

Functions for exporting nctx graphs.

as_edgelist()

Converts a nctx graph to an edgelist

save_graph()

Saves a graph to file

Utility functions for processing context information

dist_angular_distance()

Obtain Angular Distance.

dist_cosine_similarity()

Obtain Cosine Similarity.

dist_euclidean_distance()

Obtain Euclidean Distance.

dist_js_divergence()

Obtain Jenson Shannon Divergence.

dist_kl_divergence()

Obtain Kullback Leibler Divergence.