数据结构
tyilack_小小黑
这个作者很懒,什么都没留下…
展开
-
遍历元素的效率问题
public static void main(String[] args) { int [] a={1,2,3,4,5,6,7}; //第一种:性能最高 int length=a.length; for(int i=0;i<length;i++){ System.out.println("性能最高:"+a[i]); } //第二种:性能次之 for(int i转载 2014-07-13 20:19:09 · 660 阅读 · 0 评论 -
JDK8 中Stack类的实现
/* * Copyright (c) 1994, 2010, Oracle and/or its affiliates. All rights reserved. * ORACLE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. * * * * * * * * * * * * * * * *原创 2014-10-15 15:22:42 · 1016 阅读 · 0 评论 -
图的广度优先搜索BFS
public class BFSDemo { public static void main(String[] args) { // TODO Auto-generated method stub char[] vertices = {'A', 'B', 'C', 'D', 'E'}; int[][] edges = { {0, 1, 0, 1, 0}, {1原创 2015-01-17 15:43:19 · 556 阅读 · 0 评论 -
图的最小生成树
import java.util.Stack;/* * 图的最小生成树 */public class MSTDemo { public static void main(String[] args) { // TODO Auto-generated method stub char[] vertices = {'A', 'B', 'C', 'D', 'E'}; int[]原创 2015-01-17 16:06:30 · 530 阅读 · 0 评论 -
图的深度优先搜索DFS
import java.util.Stack;public class DFSDemo { public static void main(String[] args) { // TODO Auto-generated method stub char[] vertices = {'A', 'B', 'C', 'D', 'E'}; int[][] edges = { {原创 2015-01-17 15:41:29 · 448 阅读 · 0 评论