Matlab COdes for network route. You can use it for different kinds of graph algorithms




File list:
code
...\add_edge_weights.m
...\adj2adjL.m
...\adj2dl.m
...\adj2edgeL.m
...\adj2inc.m
...\adj2pajek.m
...\adj2simple.m
...\adj2str.m
...\adjL2adj.m
...\adjL2edgeL.m
...\algebraic_connectivity.m
...\average_degree.m
...\ave_neighbor_deg.m
...\ave_path_length.m
...\BFS.m
...\build_smax_graph.m
...\canonical_nets.m
...\closeness.m
...\clust_coeff.m
...\degrees.m
...\diameter.m
...\dijkstra.m
...\distance_distribution.m
...\DoddsWattsSabel.m
...\dot_matrix_plot.m
...\draw_circ_graph.m
...\edgeL2adj.m
...\edgeL2adjL.m
...\edgeL2cyto.m
...\edgeL2pajek.m
...\edgeL2simple.m
...\edgelist2dl.m
...\edge_betweenness.m
...\eigencentrality.m
...\el2geom.m
...\exponential_growth_model.m
...\fabrikant_model.m
...\fiedler_vector.m
...\find_conn_comp.m
...\forestFireModel.m
...\getEdges.m
...\getNodes.m
...\giant_component.m
...\graph_complement.m
...\graph_dual.m
...\graph_energy.m
...\graph_from_degree_sequence.m
...\graph_radius.m
...\graph_similarity.m
...\graph_spectrum.m
...\inc2adj.m
...\inc2edgeL.m
...\isbipartite.m
...\iscomplete.m
...\isconnected.m
...\isdirected.m
...\iseulerian.m
...\isgraphic.m
...\isregular.m
...\issimple.m
...\issymmetric.m
...\istree.m
...\isweighted.m
...\kmin_neighbors.m
...\kneighbors.m
...\kregular.m
...\laplacian_matrix.m
...\leaf_edges.m
...\leaf_nodes.m
...\license.txt
...\link_density.m
...\loops3.m
...\loops4.m
...\louvain_community_finding.m
...\master_equation_growth_model.m
...\min_span_tree.m
...\modularity_metric.m
...\multiedges.m
...\nested_hierarchies_model.m
...\newmangastner.m
...\newmangirvan.m
...\newman_comm_fast.m
...\newman_eigenvector_method.m
...\node_betweenness_faster.m
...\node_betweenness_slow.m
...\numedges.m
...\numnodes.m
...\num_conn_comp.m
...\num_conn_triples.m
...\num_loops.m
...\num_star_motifs.m
...\pajek2adj.m
...\pajek2edgeL.m
...\pajek2xyz.m
...\pdf_cdf_rank.m
...\pearson.m
...\preferential_attachment.m
...\PriceModel.m
...\purge.m
...\radial_plot.m
...\random_directed_graph.m
...\random_graph.m
...\random_modular_graph.m
...\rewire.m
...\rewire_assort.m
...\rewire_disassort.m
...\rich_club_metric.m
...\selfloops.m
...\shortest_pathDP.m
...\simple_dijkstra.m
...\simple_spectral_partitioning.m
...\smooth_diameter.m
...\sort_nodes_by_max_neighbor_degree.m
...\sort_nodes_by_sum_neighbor_degrees.m
...\str2adj.m
...\subgraph.m
...\symmetrize.m
...\symmetrize_edgeL.m
...\s_metric.m
...\tarjan.m
...\test_all_functions.m
...\vertex_eccentricity.m
...\weighted_clust_coeff.m