 |
图与网络
我们的周围都是图和网络，包括技术网络（因特网、电网、电话网、交通网），社会网络（社会图、附属网......）信息网络（万维网、引用图、专利网......），生物学网络（生化网、神经网，食物网......）等. 图提供一个结构模型，使得分析和理解许多独立的系统是如何一起工作成为可能.
Mathematica 为建模、分析、合成与可视化图与网络提供先进的功能. 无论这些图是小而简略还是大而复杂，Mathematica 提供多种高层次的函数用于创建或计算图. 图是 Mathematica 中的一等公民；它们可以用作输入和输出，且深深地整合进 Mathematica 系统的其它部分.
精选实例 |
-
Analyzing Road Networks
-
Apply Options of One Graph to Another
-
Boolean Operations and Graphs
-
Build Food Webs
-
Build Semantic Networks
-
Built-in Library of Edge Shapes
-
Built-in Library of Vertex Shapes
-
Centrality and Prestige of Florentine Families
-
Cliques and Cohesive Groups
-
Clustering in Small-World Networks
-
Compare Centrality in Citation Networks
-
Create Molecular Graphs
-
Curated Collections of Graphs
-
Display Planar Embeddings of Built-in Graphs
-
Encode Structures into Graphs
-
Find a Topological Ordering of Connected Graph Components
-
Find People with More Influence in a Social Network
-
Find the k-Core Components of a Graph
-
Get Information on Graphs
-
Graph Layouts
-
Highlight Connected Components in a Directed Graph
-
Highlight Graph Elements on BFS and DFS Trees
-
Pack Disconnected Components
-
Perform a Breadth-First Scan of a Graph
-
Perform a Depth-First Scan of a Graph
-
Powers of a Primitive Root
-
Show Path with Arrows in a Matrix
-
Solve the Icosian Game
-
Structure of the Web
-
Subtract Random Neighborhoods
-
Visualize Eulerian Cycles
-
Visualize Hamiltonian Cycles
参考资料
图的构建 »
Graph — 从顶点和边构建图
GraphData, ExampleData — 理论和经验图的专业集合
CompleteGraph ▪ RandomGraph ▪ AdjacencyGraph ▪ Import ▪ ...
图的表示 »
Graph — 具有顶点和边属性的图对象
UndirectedEdge (
) ▪ DirectedEdge (
) ▪ ...
社交网络分析 »
FindGraphCommunities — 求连接度良好的社区
SocialMediaData ▪ BetweennessCentrality ▪ FindKClan ▪ ...
样式、标签和布局 »
HighlightGraph — 突出显示顶点、边或者整个子图
GraphLayout ▪ VertexStyle ▪ EdgeStyle ▪ VertexLabels ▪ ...
操作和修改 »
NeighborhoodGraph — 某些顶点、边的图邻顶点和邻边
Subgraph ▪ GraphUnion ▪ VertexAdd ▪ VertexDelete ▪ EdgeAdd ▪ ...
谓词和属性 »
IsomorphicGraphQ — 测试两个图在顶点重命名后是否相同
DirectedGraphQ ▪ AcyclicGraphQ ▪ HamiltonianGraphQ ▪ ...
测量和特性 »
GraphDistance — 两个顶点之间的最短路径的长度
VertexDegree ▪ VertexEccentricity ▪ PageRankCentrality ▪ ...
路径、圈和流 »
FindMaximumFlow — 求两个顶点之间的最大流
FindShortestPath ▪ FindHamiltonianCycle ▪ FindPostmanTour ▪ ...
分量和连通性 »
ConnectedComponents — 给出强连接的顶点组
WeaklyConnectedComponents ▪ KCoreComponents ▪ EdgeConnectivity ▪ ...
圈、覆盖和独立集合 »
FindClique — 求完整的子图
FindVertexCover ▪ FindEdgeCover ▪ FindIndependentEdgeSet ▪ ...
图编程 »
DepthFirstScan — 以深度优先顺序遍历一个图
