Older Versions
MatlabBGL 3.0-beta. (Documentation not available for beta version.)
MatlabBGL 2.0 and Matlab BGL 2.0 documentation
Highlights from
MatlabBGL
- A=erdos_reyni(n,p) ERDOS_REYNI Generates a random Erdos-Reyni (Gnp) graph
- [d pred f]=astar_search(A,s,h... ASTAR_SEARCH Perform a heuristically guided (A*) search on the graph.
- [is_planar ksubgraph EI]=boye... BOYER_MYRVOLD_PLANARITY_TEST Test a graph for planarity
- [m,max_card_matching]=matchin... MATCHING Compute a maximum cardinality matching
- [p ei ej]=planar_canonical_or... PLANAR_CANONICAL_ORDERING Compute a planar canonical ordering
- [varargout]=edmonds_maximum_c... EDMONDS_MAXIMUM_CARDINALITY_MATCHING Compute a maximum cardinality matching
- [varargout]=edmunds_karp_max_... EDMUNDS_KARP_MAX_FLOW Edmunds-Karp max flow algorithm
- [varargout]=kolmogorov_max_fl... KOLMOGOROV_MAX_FLOW Kolmogorov's max flow algorithm
- [varargout]=push_relabel_max_... PUSH_RELABEL_MAX_FLOW Goldberg's push-relabel max flow algorithm
- all_shortest_paths(A,varargin) all_shortest_paths Compute the weighted all pairs shortest path problem.
- approx_multiway_cut(A,vs) APPROX_MULTIWAY_CUT Solve a 2-approximation to the multi-way cut problem
- assert(condition,varargin)
- bacon_numbers(A,u) BACON_NUMBERS Compute the Bacon numbers for a graph.
- bellman_ford_sp(A,u,varargin) BELLMAN_FORD_SP Compute the weighted single source shortest path problem.
- betweenness_centrality(A,vara... BETWEENNESS_CENTRALITY Compute the betweenness centrality for vertices.
- bfs(A,u,varargin) BFS Compute the breadth first search order.
- bfs_in_mbgl(A,u) BFS_IN_MBGL Reimplement the BFS function with MatlabBGL visitors.
- bfs_in_mbgl(A,u) BFS_IN_MBGL Reimplement the BFS function with MatlabBGL visitors.
- biconnected_components(A,vara... BICONNECTED_COMPONENTS Compute the biconnected components and
- breadth_first_search(A,u,bfs_... BREADTH_FIRST_SEARCH Fully wrap the Boost breadth_first_search call
- chrobak_payne_straight_line_d... CHROBAK_PAYNE_STRAIGHT_LINE_DRAWING Draw planar graphs with straight lines
- circle_graph_layout(G,radius) CIRCLE_LAYOUT Layout the vertices of a graph on a circle
- clique_graph(n,varargin) CLIQUE_GRAPH Generate the clique graph or bipartite clique graph
- clustering_coefficients(A,var... CLUSTERING_COEFFICIENTS Compute the clustering coefficients for vertices.
- combine_visitors(varargin) COMBINE_VISITORS Generate a new visitor by combining existing visitors
- components(A,varargin) COMPONENTS Compute the connected components of a graph.
- core_numbers(A,varargin) CORE_NUMBERS Compute the core numbers of the vertices in the graph.
- cycle_graph(n,varargin) CYCLE_GRAPH Generate the cycle graph of order n
- dag_sp(A,u,varargin) DAG_SP Compute the weighted single source shortest path problem.
- depth_first_search(A,u,dfs_vi... DEPTH_FIRST_SEARCH Fully wrap the Boost depth_first_search call
- dfs(A,u,varargin) DFS Compute the depth first search times.
- dijkstra_all_sp(G,optionsu) DIJKSTRA_ALL_SP Compute all pairs shortest path using repeated Dijkstras
- dijkstra_sp(A,u,varargin) DIJKSTRA_SP Compute the weighted single source shortest path problem.
- edge_weight_index(A,varargin) EDGE_WEIGHT_INDEX Build a conformal matrix of edge index values for a graph.
- floyd_warshall_all_sp(A,varar... FLOYD_WARSHALL_ALL_SP Compute the weighted all-pairs shortest path problem.
- fruchterman_reingold_force_di... FRUCHTERMAN_REINGOLD_FORCE_DIRECTED_LAYOUT A force directed graph layout
- grid_graph(varargin) GRID_GRAPH Generate a grid graph or hypergrid graph
- gursoy_atun_layout(A,varargin) GURSOY_ATUN_LAYOUT Layout a graph by uniformly distributing vertices
- indexed_sparse(i,j,v,m,n,vara... INDEXED_SPARSE Create a sparse matrix with indexed edges.
- is_kuratowski_graph(A,varargi... IS_KURATOWSKI_GRAPH Test if a graph can be collapsed to K_3,3 or K_5
- is_straight_line_drawing(A,X,... IS_STRAIGHT_LINE_DRAWING Test if coordinates are a straight line drawing
- johnson_all_sp(A,varargin) JOHNSON_ALL_SP Compute the weighted all-pairs shortest path problem.
- kamada_kawai_spring_layout(A,... KAMADA_KAWAI_SPRING_LAYOUT Use springs to compute a graph layout
- kruskal_mst(A,varargin) KRUSKAL_MST Compute a minimum spanning with Kruskal's algorithm.
- kuratowski_subgraph(A,varargi... KURATOWSKI_SUBGRAPH Identify a Kuratowski subgraph
- m=maximal_matching(A,varargin) MAXIMAL_MATCHING Compute a maximal matching
- make_biconnected_planar(A,var... MAKE_BICONNECTED_PLANAR Add edges to construct a biconnected planar graph
- make_connected(A,varargin) MAKE_CONNECTED Add edges to construct a connected graph
- make_maximal_planar(A,varargi... MAKE_MAXIMAL_PLANAR Add edges to construct a maximal planar graph
- max_card_match=test_matching(... TEST_MATCHING Tests if a matching is maximum cardinality
- max_flow(A,u,v,varargin) MAX_FLOW Compute the max flow on A from u to v.
- mst(A,varargin) MST Compute a minimum spanning tree for an undirected graph A.
- n=num_edges(A) NUM_EDGES The number of edges in a graph.
- n=num_vertices(A) NUM_VERTICES The number of vertices in a graph.
- out=test_benchmark % David Gleich
- path_from_pred(pred,d,varargi... PATH_FROM_PRED Convert a predecessor array into a path to a vertex.
- path_histogram(G,varargin) PATH_HISTOGRAM Compute a histogram of all shortest paths in graph G
- perm=topological_order(A,vara... TOPOLOGICAL_ORDER Returns the topological ordering of vertices in a dag
- pred=lengauer_tarjan_dominato... LENGAUER_TARJAN_DOMINATOR_TREE Compute a dominator tree for a graph.
- prim_mst(A,varargin) PRIM_MST Compute a minimum spanning with Prims's algorithm.
- random_graph_layout(G,box) RANDOM_GRAPH_LAYOUT Layout the vertices of a graph randomly
- rtest_3_cojocaru() The regression test for the bug reported by Radu Cojocaru on 9 November
- rtest_6()
- rval=rtest_1()
- rval=rtest_2()
- rval=rtest_5_henderson()
- rval=rtest_7_karsi Test the flow-graph that Karci identified as causing a problem with the
- set_matlab_bgl_default(vararg... SET_MATLAB_BGL_DEFAULT Sets a default option for the Matlab BGL interface
- shortest_paths(A,u,varargin) SHORTEST_PATHS Compute the weighted single source shortest path problem.
- star_graph(n) STAR_GRAPH Generate the star graph of order n
- test_breadth_first_search(A,u)
- test_components msgid = 'matlab_bgl:test_components';
- test_dag(A,varargin) TEST_DAG Tests if a graph is directed and acyclic
- test_depth_first_search(A,u)
- test_examples Code examples
- test_layouts msgid = 'matlab_bgl:test_layouts';
- test_main Implement a test suite for matlab_bgl
- test_planar_graph(G) TEST_PLANAR_GRAPH Test if a graph is planar
- test_shortest_paths msgid = 'matlab_bgl:test_shortest_paths';
- test_spanning_trees mst
- test_statistics msgid = 'matlab_bgl:test_statistics';
- tree_from_pred(pred) TREE_FROM_PRED Convert a predecessor array into a tree
- v=edge_weight_vector(As,A,var... EDGE_WEIGHT_VECTOR Returns input for the edge_weight option for a weighted
- wheel_graph(n) WHEEL_GRAPH Construct a wheel graph of order n
- inplace(a) INPLACE Convert to a type that supports inplace modification
- ipdouble(a) IPDOUBLE Create a double type that supports inplace modification
- ipint32(a) IPDOUBLE Create a int32 type that supports inplace modification
- Contents.m
- bfs_example.m
- core_numbers_example.m
- dfs_example.m
- edge_index_example.m
- max_flow_example.m
- multiway_example.m
- new_in_3_0.m
- new_in_4_0.m
- planar_graphs.m
- record_alg.m
- red_black.m
- reweighted_graphs.m
- rtest_all.m
- test_all.m
- test_planar.m
- test_searches.m
- test_trivial.m
- write_examples_html.m
- Core numbers in MatlabBGL
- MatlabBGL
- MatlabBGL - Changes
- MatlabBGL - FAQ
- MatlabBGL - Versions
- New features in MatlabBGL ver...
- New features in MatlabBGL ver...
- Planar graphs in MatlabBGL
- Recording algorithm behavior ...
- Red-Black Ordering with Matla...
- Reweighted graphs in MatlabBGL
- View all files
|
from
MatlabBGL
by David Gleich
MatlabBGL provides robust and efficient graph algorithms for Matlab using native data structures. |
||
|---|---|---|
|
Contact us at files@mathworks.com