blog1618的专栏

import java.util.LinkedList; //邻接矩阵表示图 广度优先搜索 public class BFS { public static void main(String [] args) { int n = 5; int [][] matrix = { {0, 1, 1, 0,0}, {1, 0, 0, 0,1}

import java.util.Arrays; public class qsort { /** * @param args */ public int partition(int array[],int low,int high) { int key = array[low]; int temp=0; while(low<high){

public class greedy { private static void recursiveActivitySelector(int s[],int f[],int i,int n) { int m = i;//被选中 while(m<n&&s[m]<f[i]) m = m + 1; if(m<n) { System.out.prin

import java.util.Arrays; public class HeapSort { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub int[] data = { 1, 4, 5, 12, 7, 8,

public class mydijkstra { static int M = 100000; /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub int[][] weight1 = { {0,3,

public class DP { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub String s1 = "abcbdab"; String s2 = "bdcaba"; int m = s1.lengt

public class prim { static int M = 1000; public static void main(String[] args) { int graph[][] = { { M, 6, 1, 5, M, M }, { 6, M, 5, M, 3, M }, { 1, 5, M, 5, 6, 4 }, { 5, M, 5, M, M, 2 }

import java.util.Stack; public class TopOrder { static int num=0; /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub int graph[][] = {

import java.util.Arrays; public class MergeSort { private static void sort(int data[],int left,int right) { if(left<right) { int center = (left+right)/2; sort(data,left,center);

import java.util.Scanner; import java.util.Arrays; import java.util.ArrayList; class Edge { public int start;//始边 public int end;//终边 public double cost;//权重

import java.util.Stack; public class DFSMy { public static void main(String[] args) { int graph[][] = {{0, 1, 1, 0,0}, {1, 0, 0, 0,1}, {1, 0, 0, 1,0}, {0, 0, 1, 0,0},

import java.util.Arrays; public class Insert { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub int a[] = {5,4,3,2,1}; insertSort(a); S