Global　routing　is　a　critical　problem　in　PCB　routing,　and　its　quality　greatly　affect　the　PCB　design　cost.　Unlike　existing　methods　based　on　traditional　rectangular　grid,　this　paper　present　a　novel　algorithm　based　on　triangular　grid　model　to　handle　the　problem.　We　first　propose　a　method　to　sort　all　the　unconnected　two-pin　nets,　then　construct　a　triangular　grid　graph　to　represent　the　routing　resources　on　the　printed　circuited　board.　Finally　we　use　the　idea　of　maximum　flow　to　find　the　paths　to　complete　global　routing　and　use　the　detailed　routing　to　get　the　result　of　completed　wires.　Experimental　results　show　that　our　algorithm　can　spend　less　time　than　the　two　state-of-the-art　routers　without　any　design　rule　violations　for　all　given　industrial　PCB　instances.　©　2023　IEEE.