java用邻接表建立图_图 邻接表 Java 实现

b30591281b34bca5b02258d4c5dbcb98.png

?

class="java">package abc.Dijkstra.pack3;

import java.util.ArrayList;

import java.util.List;

public class AlGraph {

List headNodes = new ArrayList();

void addVertex(HeadNode node) {

headNodes.add(node);

}

void addArc(HeadNode head, HeadNode tail) {

if(head.firstArcNode == null)

head.firstArcNode = new ArcNode(tail);

else {

ArcNode arcNode = head.firstArcNode;

while (arcNode.nextArcNode != null) {

arcNode = arcNode.nextArcNode;

}

arcNode.nextArcNode = new ArcNode(tail);

}

}

static AlGraph createAlGraph() {

AlGraph alG

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
邻接矩阵和邻接表是两种常用的的表示方法。下面是Java代码实现邻接矩阵和邻接表的示例: 1. 邻接矩阵表示Java代码实现: ```java import java.util.Arrays; class Graph { private int[][] adjMatrix; private int numVertices; public Graph(int numVertices) { this.numVertices = numVertices; this.adjMatrix = new int[numVertices][numVertices]; } public void addEdge(int src, int dest) { // 无向,所以需要在两个位置都设置为1 adjMatrix[src][dest] = 1; adjMatrix[dest][src] = 1; } public void printGraph() { for (int i = 0; i < numVertices; i++) { System.out.print("Vertex " + i + " is connected to: "); for (int j = 0; j < numVertices; j++) { if (adjMatrix[i][j] == 1) { System.out.print(j + " "); } } System.out.println(); } } } public class Main { public static void main(String[] args) { Graph graph = new Graph(5); graph.addEdge(0, 1); graph.addEdge(0, 4); graph.addEdge(1, 2); graph.addEdge(1, 3); graph.addEdge(1, 4); graph.addEdge(2, 3); graph.addEdge(3, 4); graph.printGraph(); } } ``` 2. 邻接表表示Java代码实现: ```java import java.util.LinkedList; class Graph { private int numVertices; private LinkedList<Integer>[] adjList; public Graph(int numVertices) { this.numVertices = numVertices; this.adjList = new LinkedList[numVertices]; for (int i = 0; i < numVertices; i++) { adjList[i] = new LinkedList<>(); } } public void addEdge(int src, int dest) { adjList[src].add(dest); adjList[dest].add(src); } public void printGraph() { for (int i = 0; i < numVertices; i++) { System.out.print("Vertex " + i + " is connected to: "); for (int j : adjList[i]) { System.out.print(j + " "); } System.out.println(); } } } public class Main { public static void main(String[] args) { Graph graph = new Graph(5); graph.addEdge(0, 1); graph.addEdge(0, 4); graph.addEdge(1, 2); graph.addEdge(1, 3); graph.addEdge(1, 4); graph.addEdge(2, 3); graph.addEdge(3, 4); graph.printGraph(); } } ``` 以上代码示例分别实现了邻接矩阵和邻接表表示Java代码。你可以根据自己的需求进行修改和扩展。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值